341 changed files with 1292 additions and 13532 deletions
--- a/.github/workflows/build_ubuntu_debug.yml
+++ b/.github/workflows/build_ubuntu_debug.yml
@ -1,47 +0,0 @@
 name: Build Debug (Ubuntu)
 on: [push, pull_request]
 env:
  # Customize the CMake build type here (Release, Debug, RelWithDebInfo, etc.)
  BUILD_TYPE: Debug
 jobs:
  build:
    # The CMake configure and build commands are platform agnostic and should work equally well on Windows or Mac.
    # You can convert this to a matrix build if you need cross-platform coverage.
    # See: https://docs.github.com/en/free-pro-team@latest/actions/learn-github-actions/managing-complex-workflows#using-a-build-matrix
    runs-on: ubuntu-latest
    strategy:
      matrix:
        compiler: [g++-10, g++-9, g++-8, g++-7, clang-6, clang-7, clang-8, clang-9, clang-10, clang-11, clang-12] 
    steps:
    - uses: actions/checkout@v4
    - name: Caching objects
      id: cache-objects
      uses: actions/cache@v4
      with:
        path: ~/.cache/ccache
        key: ${{ runner.os }}-${{env.BUILD_TYPE}}-${{ matrix.compiler }}-objects
    - name: Install Dependencies
      shell: bash
      run: |
        sudo apt-get install libeigen3-dev libboost-dev
    - name: Configure
      # Configure CMake in a 'build' subdirectory. `CMAKE_BUILD_TYPE` is only required if you are using a single-configuration generator such as make.
      # See https://cmake.org/cmake/help/latest/variable/CMAKE_BUILD_TYPE.html?highlight=cmake_build_type
      run: cmake -B ${{github.workspace}}/build -DCMAKE_BUILD_TYPE=${{env.BUILD_TYPE}} -DEDO=ON -DEDO_USE_LIB=Eigen3 -DENABLE_CMAKE_EXAMPLE=ON -DENABLE_CMAKE_TESTING=ON
    - name: Build
      # Build your program with the given configuration
      run: cmake --build ${{github.workspace}}/build --config ${{env.BUILD_TYPE}}
    - name: Test
      working-directory: ${{github.workspace}}/build
      # Execute tests defined by the CMake configuration.  
      # See https://cmake.org/cmake/help/latest/manual/ctest.1.html for more detail
      run: ctest -C ${{env.BUILD_TYPE}}
--- a/.gitignore
+++ b/.gitignore
@ -1,20 +1,11 @@
-# ignore generated files
+# ignore html files
 *.html
 *.pdf
 # ignore all textual files
 *.txt
 *.swp
 *.swo
 .kak_history
 *.log
 *.csv
 *.ods
 # ignore object and archive files
 *.[oa]
 *.bak
 *.tar*
 tags
 # ignore auto-saved files
@ -38,7 +29,4 @@ debug/*
 build/*
 website/EO_star.png
 website/paradiseo_logo.png
 Release/*
 Debug/*
 Build/*
--- a/33
+++ b/33
@ -1,52 +1,41 @@
 Current maintainers
 ===================
-
+Arnaud Liefooghe        <arnaud.liefooghe@univ-lille1.fr>
 Clive Canape            <clive.canape@inria.fr>
 Johann Dreo             <johann@dreo.fr>
 Sébastien Verel         <sebastien.verel@inria.fr>
 Active developpers
 ==================
 Alexandre Quemy         <alexandre.quemy@inria.fr>
 Benjamin Bouvier        <bnjbouv@gmail.com>
 Caner Candan            <caner@candan.fr>
 Pierre Savéant          <pierre.saveant@thalesgroup.com>
 Past contributors
 =================
 atantar
 Alesandro Sidero
 Alexandre Quemy
 Alix Zheng
 Amine Aziz-Alaoui
 Arnaud Liefooghe
 Benjamin Bouvier
 Bahri
 Caner Candan
 Clive Canape
 fatene
 Gustavo Romero Lopez
 jboisson
 Jeroen Eggermont
 Jochen Küpper
-Joost
+Joost                   <joost@dsj.nl>
 Juan Julian Merelo Guervos
 Jérémie Humeau
 Jxtopher
 Karima Boufaras
-legillono
+legillon
 Leo Bertheas
 Louis Da Costa
 Loïc Jean David Arjanen
 Maarten Keijzer
 Mammar Amara
 Manu
 Marc Schoenauer
 Marie-Éleonore
 Mostepha Khouadjia
 Olivier König
 Pierre Savéant
 Pedro Angel Castillo Valdivieso
 Potalas
 Ronald Pinho
 Steve Madere
 Sébastien Cahon
 Sébastien Verel
 Thomas Legrand
 Thibault Lasnier
 Victor Manuel Rivas Santos
 wcancino
 xohm
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@ -13,24 +13,13 @@ cmake_minimum_required(VERSION 3.10 FATAL_ERROR)
 ## Name
 project("ParadisEO"
-    VERSION 3.1.3
+    VERSION 3.0.0
    DESCRIPTION "Evolutionary optimization framework"
    LANGUAGES C CXX)
 ## Language
 set(CMAKE_CXX_STANDARD 17)
 ## ccache
 find_program(CCACHE_PROGRAM ccache)
 if (CCACHE_PROGRAM)
    message(NOTICE "-- ccache is enabled (found here: ${CCACHE_PROGRAM})")
    set_property(GLOBAL PROPERTY RULE_LAUNCH_COMPILE "\"${CCACHE_PROGRAM}\"")
    set_property(GLOBAL PROPERTY RULE_LAUNCH_LINK "\"${CCACHE_PROGRAM}\"")
 else ()
    message(NOTICE "-- ccache has not been found")
 endif ()
 ######################################################################################
 ### 2) Check dependencies
@ -63,16 +52,16 @@ include(${CMAKE_CURRENT_SOURCE_DIR}/cmake/Target.cmake)
 ######################################################################################
 ## Paths to sources of modules
-set(  EO_SRC_DIR "${PROJECT_SOURCE_DIR}/eo"   CACHE INTERNAL "ParadisEO-EO   source directory" FORCE)
+set(  EO_SRC_DIR "${CMAKE_SOURCE_DIR}/eo"   CACHE INTERNAL "ParadisEO-EO   source directory" FORCE)
-set( EDO_SRC_DIR "${PROJECT_SOURCE_DIR}/edo"  CACHE INTERNAL "ParadisEO-EDO  source directory" FORCE)
+set( EDO_SRC_DIR "${CMAKE_SOURCE_DIR}/edo"  CACHE INTERNAL "ParadisEO-EDO  source directory" FORCE)
-set(  MO_SRC_DIR "${PROJECT_SOURCE_DIR}/mo"   CACHE INTERNAL "ParadisEO-MO   source directory" FORCE)
+set(  MO_SRC_DIR "${CMAKE_SOURCE_DIR}/mo"   CACHE INTERNAL "ParadisEO-MO   source directory" FORCE)
-set(MOEO_SRC_DIR "${PROJECT_SOURCE_DIR}/moeo" CACHE INTERNAL "ParadisEO-MOEO source directory" FORCE)
+set(MOEO_SRC_DIR "${CMAKE_SOURCE_DIR}/moeo" CACHE INTERNAL "ParadisEO-MOEO source directory" FORCE)
-set( SMP_SRC_DIR "${PROJECT_SOURCE_DIR}/smp"  CACHE INTERNAL "ParadisEO-SMP  source directory" FORCE)
+set( SMP_SRC_DIR "${CMAKE_SOURCE_DIR}/smp"  CACHE INTERNAL "ParadisEO-SMP  source directory" FORCE)
-set( MPI_SRC_DIR "${PROJECT_SOURCE_DIR}/eo/src/mpi"  CACHE INTERNAL "ParadisEO-MPI source directory" FORCE)
+set( MPI_SRC_DIR "${CMAKE_SOURCE_DIR}/eo/src/mpi"  CACHE INTERNAL "ParadisEO-MPI source directory" FORCE)
-set(PROBLEMS_SRC_DIR "${PROJECT_SOURCE_DIR}/problems" CACHE INTERNAL "Problems dependant source directory" FORCE)
+set(PROBLEMS_SRC_DIR "${CMAKE_SOURCE_DIR}/problems" CACHE INTERNAL "Problems dependant source directory" FORCE)
-set(CMAKE_BASE_SOURCE_DIR ${PROJECT_SOURCE_DIR})
+set(CMAKE_BASE_SOURCE_DIR ${CMAKE_SOURCE_DIR})
 # All libraries are built in <build_dir>/lib/
 set(  EO_BIN_DIR "${CMAKE_BINARY_DIR}" CACHE INTERNAL "ParadisEO-EO   binary directory" FORCE)
@ -92,34 +81,31 @@ set(SMP "false" CACHE BOOL "Build the SMP module")
 set(MPI "false" CACHE BOOL "Build the MPI module")
 ## EO Module
-set(MODULE_NAME "Paradiseo")
+set(EO_MODULE_NAME "Evolving Object")
 set(DOXYGEN_CONFIG_DIR ${CMAKE_CURRENT_SOURCE_DIR}/doxygen)
 # set(EO_MODULE_NAME "Evolving Objects")
 set(CMAKE_SOURCE_DIR ${EO_SRC_DIR})
 add_subdirectory(${EO_SRC_DIR})
 if(NOT EO_ONLY)
    ## MO Module
-    # set(MO_MODULE_NAME "Moving Objects")
+    set(MO_MODULE_NAME "Moving objects")
    # set(MODULE_NAME "Moving Objects")
    set(CMAKE_SOURCE_DIR ${MO_SRC_DIR})
    add_subdirectory(${MO_SRC_DIR})
    ## EDO Module
    if(EDO)
-        # set(EDO_MODULE_NAME "Evolving Distribution Objects")
+        set(EDO_MODULE_NAME "Evolving Distribution Objects")
        set(CMAKE_SOURCE_DIR ${EDO_SRC_DIR})
        add_subdirectory(${EDO_SRC_DIR})
    endif()
    ## MOEO Module
-    # set(MOEO_MODULE_NAME "Multi-Objectives EO")
+    set(MOEO_MODULE_NAME "Multi-Objectives EO")
    set(CMAKE_SOURCE_DIR ${MOEO_SRC_DIR})
    add_subdirectory(${MOEO_SRC_DIR})
    ## SMP Module
    if(SMP)
-        # set(SMP_MODULE_NAME "Symmetric Multi-Processing")
+        set(SMP_MODULE_NAME "Symmetric Multi-Processing")
        set(CMAKE_SOURCE_DIR ${SMP_SRC_DIR})
        add_subdirectory(${SMP_SRC_DIR})
    endif()
--- a/INSTALL.md
+++ b/INSTALL.md
@ -2,8 +2,7 @@
 Summary
 =======
-As Paradiseo is a development framework, you do not really need to install it on all your systems.
+As Paradiseo is a development framework, you do not really need to install it on all your systems. Just put it somewhere on your development computer, compile it from here and indicate where to find it to your favorite build system.
 Just put it somewhere on your development computer, compile it from here and indicate where to find it to your favorite build system.
 Build
@ -19,11 +18,6 @@ Paradiseo use the CMake build system, so building it should be as simple as:
 mkdir build ; cd build ; cmake -DEDO=ON .. && make -j
 ```
 The file `howto_build_paradiseo.apptainer.def` shows you how to install and build from scratch.
 It is a definition file for the [Apptainer](https://apptainer.org/) container system,
 which is often used on HPC clusters.
 Develop
 -------
@ -193,13 +187,13 @@ Examples and lessons are generated when `ENABLE_CMAKE_EXAMPLE` is set.
 If you want to build a specific lesson or example, you can check the list of available targets with `make help`.
 All lessons are build on the same pattern: `<module>Lesson<number>`.
-For instance, make `moLesson4` will build the Lesson 4 from the MO module.
+For instance, make `moLesson4` will build the Lesson 4 from the MO module. 
 Easy, isn't it ?
 Tests
 -----
-By performing tests, you can check your installation.
+By performing tests, you can check your installation. 
 Testing is disable by default, except if you build with the full install type.
 To enable testing, define `ENABLE_CMAKE_TESTING` when you run cmake.
--- a/10
+++ b/10
@ -1,10 +0,0 @@
 ParadisEO modules have different licenses, see LICENSE files in each directories:
 - eo  : LGPL v2.1
 - edo : LGPL v2.1
 - mo  : CeCILL v2+ (GPL-like)
 - moeo: CeCILL v2+ (GPL-like)
 - smp : CeCILL v2+ (GPL-like)
 - problem: depend on each file (usually CeCILL).
 You may also double check the headers of source code files.
--- a/README.md
+++ b/README.md
@ -8,9 +8,7 @@ It focus on the efficiency of the implementation of solvers, by providing:
 - tools for ***automated design and selection*** of algorithms,
 - a focus on ***speed*** and several ***parallelization*** options.
-<div align="center">
+![Paradiseo logo](https://github.com/nojhan/paradiseo/blob/master/website/paradiseo_logo_200px_dark.png)
  <img width="640" alt="Paradiseo logo" src="https://raw.githubusercontent.com/nojhan/paradiseo/master/docs/img/paradiseo_logo_dark.svg"/>
 </div>
 # Quick Start
@ -168,7 +166,7 @@ It is, for instance, easy to start with a simple local search, then add multi-ob
 Paradiseo is mainly developed under Linux operating systems, where its dependencies and the C++ toolchain are easy to install. Recent versions have been tested with gcc and clang compilers.
-Stable versions should however work on Windows and any Unix-like operating system with a standard-conforming C++ development system.
+Stable versions should however work on Windows and any Unix-like operating system with a standard-conforming C++ development system. 
 # Code
@ -195,7 +193,7 @@ The build chain uses the classical workflow of CMake. The recommended method is
 Under Linux, the default is make, and a build command is straitghtforward: `mkdir build ; cd build ; cmake .. && make -j`.
-There is, however, several build options which you may want to switch. To see them, we recommend the use of a CMake gui, like ccmake or cmake-gui. On the command line, you can see the available options with: `cmake -LH ..` . Those options can be set with the `-D<option>=<value>` argument to cmake.
+There is, however, several build options which you may want to switch. To see them, we recommend the use of a CMake gui, like ccmake or cmake-gui . On the command line, you can see the available options with: `cmake -LH ..` . Those options can be set with the `-D<option>=<value>` argument to cmake.
 **The first option to consider is `CMAKE_BUILD_TYPE`, which you most probably want to set to `Debug` (during development/tests) or `Release` (for production/validation).**
@ -208,13 +206,6 @@ If you `ENABLE_CMAKE_TESTING` and `BUILD_TESTING`, it will be the tests, which y
 If you `ENABLE_CMAKE_EXAMPLE`, it will also build the examples.
 If may want to make build scripts more verbose (especially when building the
 doc) by enabling `CMAKE_VERBOSE_MAKEFILE`.
 If `ccache` installed in your environment, it will try its best to re-use other compilations,
 which may speed-up your builds if you manage several compatible builds at the same time.
 To clear all cached objects, execute `ccache -C`.
 ## Licenses
 Paradiseo is distributed under the GNU Lesser General Public License and the CeCILL license (depending on the modules).
@ -239,35 +230,11 @@ For academic articles, books, more tutorials, presentations slides,
 real life example of solvers and contact information,
 please see the web site (available in `paradiseo/website/index.html`).
 There is also an [online wiki](https://gitlab.inria.fr/paradiseo/paradiseo/-/wikis/home)
 # Citing Paradiseo
 If you use Paradiseo, please cite the following publication:
 Johann Dreo, Arnaud Liefooghe, Sébastien Verel, Marc Schoenauer, Juan J. Merelo, Alexandre Quemy, Benjamin Bouvier, and Jan Gmys, [Paradiseo: from a modular framework for evolutionary computation to the automated design of metaheuristics —22 years of Paradiseo—](https://doi.org/10.1145/3449726.3463276), GECCO'21: Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1522–1530 (2021).
 BiBTeX entry:
 ```
@inproceedings{Dreo-al_2021_Paradiseo,
    author    = {Dreo, Johann and Liefooghe, Arnaud and Verel, S\'{e}bastien and Schoenauer, Marc and Merelo, Juan J. and Quemy, Alexandre and Bouvier, Benjamin and Gmys, Jan},
    title     = {Paradiseo: From a Modular Framework for Evolutionary Computation to the Automated Design of Metaheuristics: 22 Years of Paradiseo},
    year      = {2021},
    isbn      = {9781450383516},
    publisher = {Association for Computing Machinery},
    address   = {Online conference},
    url       = {https://doi.org/10.1145/3449726.3463276},
    booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference Companion},
    pages     = {1522–1530},
    numpages  = {9}
 }
 ```
 # Contact
 For further information about ParadisEO, help or to report any
-problem, you can either:
+problem, you can send an e-mail to: `paradiseo-help@lists.gforge.inria.fr`
 - Chat with us on our Matrix chatroom: https://app.element.io/#/room/#paradiseo:matrix.org
 - Post an issue: https://github.com/nojhan/paradiseo/issues
--- a/cmake/Target.cmake
+++ b/cmake/Target.cmake
@ -27,7 +27,7 @@ if(DOXYGEN_FOUND AND DOXYGEN_EXECUTABLE)
    #         set(DOC_SMP "")
    #     endif()
    #     if(MPI)
-            # set(DOC_MPI "make doc-mpi")
+    #         set(DOC_MPI "make doc-mpi")
    #     else()
    #         set(DOC_MPI "")
    #     endif()
@ -78,7 +78,7 @@ if(DOXYGEN_FOUND AND DOXYGEN_EXECUTABLE)
                COMMAND make doc-eo
                COMMAND make doc-mo
                COMMAND make doc-moeo
-                # COMMAND make doc-mpi
+                COMMAND make doc-mpi
            )
        endif()
@ -89,7 +89,7 @@ if(DOXYGEN_FOUND AND DOXYGEN_EXECUTABLE)
                COMMAND make doc-mo
                COMMAND make doc-moeo
                COMMAND make doc-smp
-                # COMMAND make doc-mpi
+                COMMAND make doc-mpi
            )
        endif()
        if(EDO AND NOT SMP AND MPI)
@ -98,7 +98,7 @@ if(DOXYGEN_FOUND AND DOXYGEN_EXECUTABLE)
                COMMAND make doc-mo
                COMMAND make doc-moeo
                COMMAND make doc-edo
-                # COMMAND make doc-mpi
+                COMMAND make doc-mpi
            )
        endif()
        if(EDO AND SMP AND NOT MPI)
@ -119,7 +119,7 @@ if(DOXYGEN_FOUND AND DOXYGEN_EXECUTABLE)
                COMMAND make doc-moeo
                COMMAND make doc-edo
                COMMAND make doc-smp
-                # COMMAND make doc-mpi
+                COMMAND make doc-mpi
            )
        endif()
@ -131,7 +131,7 @@ endif(DOXYGEN_FOUND AND DOXYGEN_EXECUTABLE)
 ######################################################################################
 if(PROFILING)
-    find_program(LCOV
+    find_program(LCOV 
        NAMES lcov
        PATHS
        "/usr/local/bin /usr/bin [HKEY_LOCAL_MACHINE\\SOFTWARE\\Rational Software\\Purify\\Setup;InstallFolder] [HKEY_CURRENT_USER\\Software]"
--- a/docs/index.html
+++ b/docs/index.html
@ -28,9 +28,9 @@
            <p>Shortcuts:</p>
            <ul>
                <li><a href="#Why">Why choosing <em class="logo">Paradis<span class="logo_eo">eo</span></em>?</a></li>
-                <li><a href="https://github.com/nojhan/paradiseo/releases">Downloads</a></li>
+                <li><a href="https://gforge.inria.fr/frs/?group_id=145">Downloads</a></li>
-                <li><a href="https://github.com/nojhan/paradiseo">Git repository</a></li>
+                <li><a href="https://gforge.inria.fr/scm/?group_id=145">Git repository</a></li>
-                <li><a href="https://app.element.io/#/room/#paradiseo:matrix.org">Chat with us</a></li>
+                <li><a href="http://irc.lc/freenode/paradiseo">Chat with us</a></li>
            </ul>
        </div>
@ -125,9 +125,9 @@
    <div id="Download">
    <h2><a name="Download"></a>Download</h2>
-    Download the <a href="https://github.com/nojhan/paradiseo/releases">latest stable release</a>.
+    Download the <a href="https://gforge.inria.fr/frs/download.php/31733/Paradiseo-2.0.1.zip">latest stable release</a>.
-    <p>Or clone the latest version: <code class="command">git clone https://github.com/nojhan/paradiseo.git</code></p>
+    <p>Or clone the latest version: <code class="command">git clone git://scm.gforge.inria.fr/paradiseo/paradiseo.git</code></p>
    </div>
    <div id="Build">
@ -147,9 +147,7 @@
    <div id="Develop">
    <h2><a name="Develop"></a>Develop</h2>
    <!--
    <p>Download the <a href="https://gforge.inria.fr/frs/download.php/31755/QuickStart.zip">quick start project template</a>, edit the <code>CMakeLists.txt</code> file to indicate where to find <em class="logo">Paradis<span class="logo_eo">eo</span></em> and start developing your own solver.</p>
    -->
    <p>To show you how does a <em class="logo">Paradis<span class="logo_eo">eo</span></em> code look, you will find here a minimal implementation of the popular <a href="https://en.wikipedia.org/wiki/CMA-ES">CMA-ES algorithm</a>.</p>
@ -238,7 +236,7 @@
    answers is to send an email to <a href='mailto:paradiseo-help@lists.gforge.inria.fr'>paradiseo-help@lists.gforge.inria.fr</a>. You can also <a href='http://lists.gforge.inria.fr/pipermail/paradiseo-help/'>consult the help archives</a>, subscribe to our <a href='http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/paradiseo-users'>(low traffic) mailing-list</a> or <a href='http://lists.gforge.inria.fr/pipermail/paradiseo-users/'>consult its archives</a>.
    </p>
-    <p>Alternatively, you can join us on the official chatroom. You can try the <a href="https://app.element.io/#/room/#paradiseo:matrix.org">online webchat app</a>, or if you already use <a href="https://element.io">Element.io</a>, you can directly connect to the <em>#paradiseo:matrix.org</em> multi-user chatroom with your favorite client.</p>
+    <p>Alternatively, you can join us on the official chatroom. You can try our <a href="http://irc.lc/freenode/paradiseo">webchat interface</a>, or if you already use IRC, you can directly connect to the <a href="irc://irc.freenode.org/#paradiseo">irc.freenode.org/#paradiseo</a> multi-user chatroom with your favorite client.</p>
    </div>
    </div>
@ -302,7 +300,7 @@
    <div id="Why_efficiency">
    <h3>Efficient</h3>
-    <p class="excerpt"><em class="logo">Paradis<span class="logo_eo">eo</span></em> is <em>the fastest</em> framework on the market, which is a crucial feature for modern and robust approach to solver <em>design and validation</em> (especially on combinatorial problems).</p>
+    <p class="excerpt"><em class="logo">Paradis<span class="logo_eo">eo</span></em> is <em>the fastest</em> framework on the market, which is a crucial feature for modern and robust approach to solver <em>design and validation</em>.</p>
    </div>
    <div id="Why_efficiency_details">
@ -311,7 +309,6 @@
        <p>Another classical criticism against <em class="logo">Paradis<span class="logo_eo">eo</span></em> is that C++ is hard and that a fast language is useless because speed is not a concern when your objective function is dominating all the runtime.</p>
        <p>However, we argue that:
            <ul>
                <li>The numerical optimization community often sees objective functions as monolithic “black-box”, but in combinatorial opimization, it is very often the case that the objective function can be only partially evaluated on neighbor solutions, which allows for (tremendous) speed gains. The Paradiseo-mo module is architectured around that idea, a feature that is not so often found in other frameworks.</li>
                <li>During the design phase of your solver, you will need to estimate its performance against synthetic benchmarks that are fast to compute. In that case, fast computation means fast design iterations. And it's even more true if you plan to use automated design to find the best solver for your problem.</li>
                <li>Modern C++ makes use of the very same high-level abstractions you would find in more accepted languages like Python. Sure, the syntax is cumbersome, but you will not see it after a while, given that you will work at the algorithm level.</li>
                <li>C++ provides full type checking and the largest set of tooling for any modern language, which are your first line of defense against long-term bugs. Sure, it sometimes gives you the impression that you fight against the compiler, but chasing subtle interface bugs across a complex Python code is even harder.</li>
@ -811,32 +808,18 @@
    <ul>
        <li>
-            <p>The latest state of the whole <em class="logo">Paradis<span class="logo_eo">eo</span></em> framework is introduced in the following article (see also <a href="https://arxiv.org/abs/2105.00420">the preprint</a>):
+            <p>The core EO module is described in the following scientific article:
-            <blockquote>Johann Dreo, Arnaud Liefooghe, Sébastien Verel, Marc Schoenauer, Juan J. Merelo, Alexandre Quemy, Benjamin Bouvier, and Jan Gmys,
+            <blockquote>M. Keijzer, J.J. Merelo, G. Romero, G., M. Schoenauer,
-                <a href= "https://doi.org/10.1145/3449726.3463276">Paradiseo: from a modular framework for evolutionary computation to the automated design of metaheuristics —22 years of Paradiseo—</a>, <i>GECCO'21: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1522–1530 (2021).</blockquote>
+                <a href= "http://www.lri.fr/~marc/EO/EO-EA01.ps.gz">Evolving
                    objects: A general purpose evolutionary computation
                    library</a>, <i>Artificial Evolution</i>, <b>2310</b>, 829--888 (2002).</blockquote>
            </p>
-            
+
-            <button class="collapsible">BiBTeX entry for citing <em class="logo">Paradis<span class="logo_eo">eo</span></em>…</button>
+            <button class="collapsible">BiBTeX entry for citing EO…</button>
            <div class="details">
-                <p>If you used <em class="logo">Paradis<span class="logo_eo">eo</span></em> in a study, please cite the publication above:</p>
+                <p>If you used EO in a study, please cite it. As of today, it has been <a href="https://scholar.google.com/scholar?cites=900770489172177244&as_sdt=2005&sciodt=0,5&hl=fr">cited more than 250 times.</a></p>
                <figure style="text-align:left;">
                    <p>
                        <font face="monospace">
                        @<font color="#f917f3">inproceedings</font>{<font color="#519f50">Dreo-al_2021_Paradiseo</font>,<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>author</b></font>&nbsp;&nbsp;&nbsp;&nbsp;=&nbsp;{Dreo, Johann and Liefooghe, Arnaud and Verel, S\'{e}bastien and Schoenauer, Marc and Merelo, Juan J. and Quemy, Alexandre and Bouvier, Benjamin and Gmys, Jan},<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>title</b></font>&nbsp;&nbsp;&nbsp;&nbsp; =&nbsp;{Paradiseo: From a Modular Framework for Evolutionary Computation to the Automated Design of Metaheuristics: 22 Years of Paradiseo},<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>year</b></font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=&nbsp;{2021},<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>isbn</b></font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=&nbsp;{9781450383516},<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>publisher</b></font>&nbsp;=&nbsp;{Association for Computing Machinery},<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>address</b></font>&nbsp;&nbsp; =&nbsp;{Online conference},<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>url</b></font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =&nbsp;{<a href="https://doi.org/10.1145/3449726.3463276},">https://doi.org/10.1145/3449726.3463276},</a><br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>booktitle</b></font>&nbsp;=&nbsp;{Proceedings of the Genetic and Evolutionary Computation Conference Companion},<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#da4939"><b>pages</b></font>&nbsp;&nbsp;&nbsp;&nbsp; =&nbsp;{1522–1530},<br>
                        &nbsp;&nbsp;&nbsp;&nbsp;<font color="#6d9cbe">numpages</font>&nbsp;&nbsp;=&nbsp;{9}<br>
                        }<br>
                        </font>
                    <!--
                    <font face="monospace">
                        @<font color="#0000ff">Article</font>{<font color="#ff00ff">Keijzer2001</font>,<br/>
                        &nbsp;&nbsp;<font color="#a52a2a">title</font>&nbsp;=&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&quot;Evolving Objects: A General Purpose Evolutionary Computation Library &quot;,<br/>
@ -848,25 +831,21 @@
                        &nbsp;&nbsp;<font color="#a020f0">keywords</font>&nbsp;=&nbsp; &quot;genetic algorithms, genetic programming, evolutionary computation, metaheuristic, computational intelligence, optimization&quot;,<br/>
                        &nbsp;&nbsp;<font color="#a020f0">URL</font>&nbsp;=&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&quot;<a href="http://www.lri.fr/~marc/EO/EO-EA01.ps.gz">http://www.lri.fr/~marc/EO/EO-EA01.ps.gz</a>&quot;,<br/>
                        &nbsp;&nbsp;<font color="#ff00ff">size</font>&nbsp;=&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &quot;12 pages&quot;,<br/>
                        <!-- &nbsp;&nbsp;<font color="#a020f0">abstract</font>&nbsp;=&nbsp; &quot;This paper presents the evolving objects library<br/> -->
                        <!-- &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (EOlib), an object-oriented framework for evolutionary<br/> -->
                        <!-- &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; computation (EC)&nbsp;that aims to provide a flexible set of<br/> -->
                        <!-- &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; classes to build EC applications. EOlib design<br/> -->
                        <!-- &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; objective is to be able to evolve any object in which<br/> -->
                        <!-- &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; fitness makes sense.&quot;,<br/> -->
                        }<br/>
                        <br/>
                    </font>
                    -->
                    </p>
                    <figcaption></figcaption>
                </figure>
            </div>
        </li>
        <li>
            <p>The core EO module is described in the following scientific article:
            <blockquote>M. Keijzer, J.J. Merelo, G. Romero, G., M. Schoenauer,
                <a href= "http://www.lri.fr/~marc/EO/EO-EA01.ps.gz">Evolving
                    objects: A general purpose evolutionary computation
                    library</a>, <i>Artificial Evolution</i>, <b>2310</b>, 829--888 (2002).</blockquote>
            </p>
        </li>
        <!-- <li> -->
        <!--     <p>The parallelization modules have been described in: -->
        <!--     <blockquote>S. Cahon, N. Melab and E-G. Talbi, <a href="http://www.springerlink.com/content/up02m74726v1526u/"><em class="logo">Paradis<span class="logo_eo">eo</span></em>: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics</a>, Journal of Heuristics, vol. 10(3), pp.357-380, May 2004.</blockquote> -->
@ -927,31 +906,10 @@ ISBN: 978-0-470-27858-1</blockquote>
    <ul class="publications">
    </ul>
 <h3>Accelerator Physics</h3>
 <ul>
    <li>E. Valetov, G. Dal Maso, P-R. Kettle, A. Knecht, A. Papa, on behalf of the HIMB Project. <a href="https://doi.org/10.3390/particles7030039">Beamline Optimisation for High-Intensity Muon Beams at PSI Using the Heterogeneous Island Model</a>. <i>Particles</i> (2024), <i>7</i>, 683-691.</li>
 </ul>
 <h3>Bioinformatics</h3>
 <ul>
    <li> Emile Zakiev, Johann Dreo, Mara Santarelli, Benno Schwikowski, <a href="https://hal.science/hal-04110700">Statistical Discovery of Transcriptomic Cancer Signatures using Multimodal Local Search</a>, <i>PGMO Days</i> (2022).</li>
 </ul>
 <h3>Metaheuristics Design</h3>
 <ul>
        <li>Johann Dreo, Carola Doerr, Amine Aziz-Alaoui, Alix Zheng, <a href="https://hal.science/hal-04110704/document">Using irace, paradiseo and iohprofiler for large-scale algorithm configuration</a>, <i>8th COnfiguration and SElection of ALgorithms (COSEAL) workshop</i> (2021).</li>
        <li>Amine Aziz-Alaoui, Carola Doerr, Johann Dreo, <a href="https://arxiv.org/abs/2102.06435">Towards large scale automated algorithm design by integrating modular benchmarking frameworks</a>, <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i> (2021).</li>
        <li>Johann Dréo, Carola Doerr, Yann Semet, <a href="https://hal.sorbonne-universite.fr/hal-02179604/document">Coupling the design of benchmark with algorithm in landscape-aware solver design</a>, <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i> (2019).</li>
        <li>Johann Dreo, <a href="https://dl.acm.org/doi/10.1145/1570256.1570301">Using Performance Fronts for Parameter Setting of Stochastic Metaheuristics</a>, <i>Genetic and Evolutionary Computation Conference</i>, (2009).</li>
 </ul>
 <h3>Automated Planning</h3>
 <ul>
    <li>Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dreo, Pierre Savéant, <a href="https://arxiv.org/abs/1305.2265v1">Quality measures of parameter tuning for aggregated multi-objective temporal planning</a>, <i>7th International Conference on Learning and Intelligent Optimization (LION 7)</i> (2013).</li>
    <li>Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dreo, Pierre Savéant, <a href="https://arxiv.org/abs/1305.1169v1">Multi-Objective AI Planning: Comparing Aggregation and Pareto Approaches</a>, <i>Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP)</i> (2013).</li>
    <li>Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dreo, Pierre Savéant, <a href="https://arxiv.org/abs/1212.5276">Multi-Objective AI Planning: Evaluating DAE-YAHSP on a Tunable Benchmark</a>, <i>7th International Conference on Evolutionary Multi-Criterion Optimization</i> (2013).</li>
    <li>Jacques Bibaï, Pierre Savéant, Marc Schoenauer, Vincent Vidal, <a href="http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1414">An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning</a>, <i>Twentieth International Conference on Automated Planning and Scheduling </i> (2010). <strong>Winner of the International Planning Competition</strong></li>
-    <li>Jacques Bibaï, Pierre Savéant, Marc Schoenauer, Vincent Vidal, <a href="">An Evolutionary Metaheuristic for Domain-Independent Satisficing Planning</a>, <i>Genetic and Evolutionary Computation Conference</i> (2010). <strong>Silver Medal at the Human-Competitive Competition</strong></li>
+        <li>Jacques Bibaï, Pierre Savéant, Marc Schoenauer, Vincent Vidal, <a href="">An Evolutionary Metaheuristic for Domain-Independent Satisficing Planning</a>, <i>Genetic and Evolutionary Computation Conference</i> (2010). <strong>Silver Medal at the Human-Competitive Competition</strong></li>
 </ul>
@ -1015,6 +973,11 @@ undiscovered knowledge.
            physics/0603108 (2006)</a>.</li>
 </ul>
 <h3>Metaheuristics Design</h3>
 <ul>
        <li>Johann Dreo, <a href="https://dl.acm.org/doi/10.1145/1570256.1570301">Using Performance Fronts for Parameter Setting of Stochastic Metaheuristics</a>, <i>Genetic and Evolutionary Computation Conference</i>, (2009).</li>
 </ul>
    </div>
    </div>
@ -1169,17 +1132,16 @@ undiscovered knowledge.
    <div id="Downloads">
    <h2><a name="Downloads"></a>Downloads</h2>
-    <p>The current stable release is version: <a href="https://github.com/nojhan/paradiseo/releases">Paradiseo 3.1.3</a>. Some other releases (older or newer) can be found on <a href="https://github.com/nojhan/paradiseo/tags">GitHub/paradiseo/releases</a>.</p>
+    <p>The current stable release is version 2.0.1: <a href="https://gforge.inria.fr/frs/download.php/31733/Paradiseo-2.0.1.ziph">ParadisEO 2.0.1</a>. Some other releases (older or newer) can be found on <a href="https://github.com/nojhan/paradiseo/releases">GitHub/paradiseo/releases</a>.</p>
-    <p> You can obtain the latest stable and beta version directly via the Git repository:
+    <p> You can obtain the latest stable and beta version directly via the official Git repository:
-    <code class="command">git clone https://github.com/jdreo/paradiseo.git</code>.
+    <code class="command">git clone git://scm.gforge.inria.fr/paradiseo/paradiseo.git</code>.
    The release are on the "master" branch.
    </p>
    <p>Or you can use (at your own risks) the development repositories of the developers:
        <ul>
-            <li>Johann Dreo's: <a href="https://github.com/jdreo/paradiseo">on GitHub</a>.</li>
+            <li>Johann Dreo's: <a href="https://github.com/nojhan/paradiseo">on GitHub</b>.</li>
            <li>INRIA's: <a href="https://gitlab.inria.fr/paradiseo/paradiseo">on their Gitlab</a>.</li>
        </ul>
    </p>
    </div>
@ -1221,7 +1183,7 @@ undiscovered knowledge.
    </p>
    <p>There is, however, several build options which you may want to switch.
-    To see them, we recommend the use of a CMake gui, like <code>ccmake</code> (available through the <code>cmake-curses-gui</code> package in Debian/Ubuntu) or <a href="https://cmake.org/cmake/help/latest/guide/user-interaction/index.html#cmake-gui-tool">cmake-gui</a>.
+    To see them, we recommend the use of a CMake gui, like <code>ccmake</code> or <code>cmake-gui</code>.
    On the command line, you can see the available options with: <code class="command">cmake -LH ..</code>.
    Those options can be set with the <code>-D&lt;option&gt;=&lt;value&gt;</code> argument to cmake.
    </p>
@ -1252,7 +1214,7 @@ undiscovered knowledge.
    <h2><a name="Contribute"></a>Contribute</h2>
    <p><em class="logo">Paradis<span class="logo_eo">eo</span></em> development is open and contributions are welcomed.</p>
-    <p>The official bug tracker is available on the <a href="https://github.com/nojhan/paradiseo/issues">project page</a>.</p>
+    <p>The official bug tracker is available on the <a href="https://gforge.inria.fr/projects/paradiseo/">project page</a>. But you may be more confortable using the <a href="https://github.com/nojhan/paradiseo/issues">issue tracker of Johann Dreo's project page on GitHub</a>.</p>
    <p>If you have any question about contributing: subscribe to our <a href='http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/paradiseo-users'>(low traffic) mailing-list</a>.</p>
    </div>
@ -1269,8 +1231,7 @@ undiscovered knowledge.
    <ul>
        <li><a href="https://www.inria.fr">INRIA</a> (current maintainer)</li>
        <li><a href="https://www.univ-littoral.fr/">University of the Littoral Opal Coast</a> (current maintainer)</li>
-        <li><a href="https://www.pasteur.fr/">Institut Pasteur</a> (current maintainer)</li>
+        <li><a href="https://thalesgroup.com">Thales</a> (current maintainer)</li>
        <li><a href="https://thalesgroup.com">Thales group</a></li>
        <li><a href="https://www.polytechnique.edu/">École Polytechnique</a></li>
        <li><a href="https://www.ugr.es">University of Granada</a></li>
        <li><a href="https://www.vu.nl">Vrije Universiteit Amsterdam</a></li>
--- a/doxygen/DoxygenLayout.xml
+++ b/doxygen/DoxygenLayout.xml
@ -1,226 +0,0 @@
 <doxygenlayout version="1.0">
  <!-- Generated by doxygen 1.8.17 -->
  <!-- Navigation index tabs for HTML output -->
  <navindex>
    <tab type="mainpage" visible="yes" title=""/>
    <tab type="pages" visible="yes" title="" intro=""/>
    <tab type="modules" visible="yes" title="" intro=""/>
    <tab type="namespaces" visible="yes" title="">
      <tab type="namespacelist" visible="yes" title="" intro=""/>
      <tab type="namespacemembers" visible="yes" title="" intro=""/>
    </tab>
    <tab type="interfaces" visible="yes" title="">
      <tab type="interfacelist" visible="yes" title="" intro=""/>
      <tab type="interfaceindex" visible="$ALPHABETICAL_INDEX" title=""/> 
      <tab type="interfacehierarchy" visible="yes" title="" intro=""/>
    </tab>
    <tab type="classes" visible="yes" title="">
      <tab type="classlist" visible="yes" title="" intro=""/>
      <tab type="classindex" visible="$ALPHABETICAL_INDEX" title=""/> 
      <tab type="hierarchy" visible="yes" title="" intro=""/>
      <tab type="classmembers" visible="yes" title="" intro=""/>
    </tab>
    <tab type="structs" visible="yes" title="">
      <tab type="structlist" visible="yes" title="" intro=""/>
      <tab type="structindex" visible="$ALPHABETICAL_INDEX" title=""/> 
    </tab>
    <tab type="exceptions" visible="yes" title="">
      <tab type="exceptionlist" visible="yes" title="" intro=""/>
      <tab type="exceptionindex" visible="$ALPHABETICAL_INDEX" title=""/> 
      <tab type="exceptionhierarchy" visible="yes" title="" intro=""/>
    </tab>
    <tab type="files" visible="yes" title="">
      <tab type="filelist" visible="yes" title="" intro=""/>
      <tab type="globals" visible="yes" title="" intro=""/>
    </tab>
    <tab type="examples" visible="yes" title="" intro=""/>  
  </navindex>
  <!-- Layout definition for a class page -->
  <class>
    <briefdescription visible="yes"/>
    <includes visible="$SHOW_INCLUDE_FILES"/>
    <inheritancegraph visible="$CLASS_GRAPH"/>
    <collaborationgraph visible="$COLLABORATION_GRAPH"/>
    <detaileddescription title=""/>
    <memberdecl>
      <publicmethods title=""/>
      <publicstaticmethods title=""/>
      <publicattributes title=""/>
      <publicstaticattributes title=""/>
      <protectedtypes title=""/>
      <protectedslots title=""/>
      <protectedmethods title=""/>
      <protectedstaticmethods title=""/>
      <protectedattributes title=""/>
      <protectedstaticattributes title=""/>
      <nestedclasses visible="yes" title=""/>
      <publictypes title=""/>
      <services title=""/>
      <interfaces title=""/>
      <publicslots title=""/>
      <signals title=""/>
      <packagetypes title=""/>
      <packagemethods title=""/>
      <packagestaticmethods title=""/>
      <packageattributes title=""/>
      <packagestaticattributes title=""/>
      <properties title=""/>
      <events title=""/>
      <privatetypes title=""/>
      <privateslots title=""/>
      <privatemethods title=""/>
      <privatestaticmethods title=""/>
      <privateattributes title=""/>
      <privatestaticattributes title=""/>
      <friends title=""/>
      <related title="" subtitle=""/>
      <membergroups visible="yes"/>
    </memberdecl>
    <memberdef>
      <constructors title=""/>
      <functions title=""/>
      <related title=""/>
      <variables title=""/>
      <properties title=""/>
      <inlineclasses title=""/>
      <typedefs title=""/>
      <enums title=""/>
      <services title=""/>
      <interfaces title=""/>
      <events title=""/>
    </memberdef>
    <allmemberslink visible="yes"/>
    <usedfiles visible="$SHOW_USED_FILES"/>
    <authorsection visible="yes"/>
  </class>
  <!-- Layout definition for a namespace page -->
  <namespace>
    <briefdescription visible="yes"/>
    <detaileddescription title=""/>
    <memberdecl>
      <nestednamespaces visible="yes" title=""/>
      <constantgroups visible="yes" title=""/>
      <interfaces visible="yes" title=""/>
      <classes visible="yes" title=""/>
      <structs visible="yes" title=""/>
      <exceptions visible="yes" title=""/>
      <typedefs title=""/>
      <sequences title=""/>
      <dictionaries title=""/>
      <enums title=""/>
      <functions title=""/>
      <variables title=""/>
      <membergroups visible="yes"/>
    </memberdecl>
    <memberdef>
      <inlineclasses title=""/>
      <typedefs title=""/>
      <sequences title=""/>
      <dictionaries title=""/>
      <enums title=""/>
      <functions title=""/>
      <variables title=""/>
    </memberdef>
    <authorsection visible="yes"/>
  </namespace>
  <!-- Layout definition for a file page -->
  <file>
    <briefdescription visible="yes"/>
    <includes visible="$SHOW_INCLUDE_FILES"/>
    <includegraph visible="$INCLUDE_GRAPH"/>
    <includedbygraph visible="$INCLUDED_BY_GRAPH"/>
    <sourcelink visible="yes"/>
    <detaileddescription title=""/>
    <memberdecl>
      <interfaces visible="yes" title=""/>
      <classes visible="yes" title=""/>
      <structs visible="yes" title=""/>
      <exceptions visible="yes" title=""/>
      <namespaces visible="yes" title=""/>
      <constantgroups visible="yes" title=""/>
      <defines title=""/>
      <typedefs title=""/>
      <sequences title=""/>
      <dictionaries title=""/>
      <enums title=""/>
      <functions title=""/>
      <variables title=""/>
      <membergroups visible="yes"/>
    </memberdecl>
    <memberdef>
      <inlineclasses title=""/>
      <defines title=""/>
      <typedefs title=""/>
      <sequences title=""/>
      <dictionaries title=""/>
      <enums title=""/>
      <functions title=""/>
      <variables title=""/>
    </memberdef>
    <authorsection/>
  </file>
  <!-- Layout definition for a group page -->
  <group>
    <briefdescription visible="yes"/>
    <groupgraph visible="$GROUP_GRAPHS"/>
    <detaileddescription title=""/>
    <memberdecl>
      <nestedgroups visible="yes" title=""/>
      <namespaces visible="yes" title=""/>
      <functions title=""/>
      <classes visible="yes" title=""/>
      <defines title=""/>
      <typedefs title=""/>
      <dirs visible="yes" title=""/>
      <files visible="yes" title=""/>
      <sequences title=""/>
      <dictionaries title=""/>
      <enums title=""/>
      <enumvalues title=""/>
      <variables title=""/>
      <signals title=""/>
      <publicslots title=""/>
      <protectedslots title=""/>
      <privateslots title=""/>
      <events title=""/>
      <properties title=""/>
      <friends title=""/>
      <membergroups visible="yes"/>
    </memberdecl>
    <memberdef>
      <pagedocs/>
      <inlineclasses title=""/>
      <defines title=""/>
      <typedefs title=""/>
      <sequences title=""/>
      <dictionaries title=""/>
      <enums title=""/>
      <enumvalues title=""/>
      <functions title=""/>
      <variables title=""/>
      <signals title=""/>
      <publicslots title=""/>
      <protectedslots title=""/>
      <privateslots title=""/>
      <events title=""/>
      <properties title=""/>
      <friends title=""/>
    </memberdef>
    <authorsection visible="yes"/>
  </group>
  <!-- Layout definition for a directory page -->
  <directory>
    <briefdescription visible="yes"/>
    <directorygraph visible="yes"/>
    <detaileddescription title=""/>
    <memberdecl>
      <dirs visible="yes"/>
      <files visible="yes"/>
    </memberdecl>
  </directory>
 </doxygenlayout>
--- a/doxygen/doxygen-style.css
+++ b/doxygen/doxygen-style.css
@ -1,791 +0,0 @@
 /* This doxygen theme is free to use. If you like this, please Star https://github.com/kcwongjoe/doxygen_theme_flat_design */
 /* Color Pattern. You can change this pattern to design your theme. */
 :root {
    /* Content */
    --bgcolor: #ffffff;
    --bgfont: #303030;
    --bgfont2: #3771c8;
    --bgfont-hover: #3771c8;
    --bgfont-hover-text-decoration: underline solid #3771c8;
    --bgborder: #7d7d7d;
    --bgborder2: #f6f6f6;
    --bgfont-link:#1751a8;
    /* Main Header */
    --bg1color: #303030;
    --bg1font: #ffffff;
    --bg1font2: #3771c8;
    /* Second header */
    --bg2color: #E2E2E2;
    --bg2font: #7D7D7D;
    --bg2-hover-bg: #ffffff;
    --bg2-hover-font: #303030;
    --bg2-hover-topborder: #3771c8;
    /* Third header */
    --bg3color: #f6f6f6;
    --bg3font: #303030;
    --bg3font2: #7D7D7D;
    /* Code */
    --code-bg: #232323;
    --code-comment: #a5c261;
    --code-keyword: #db4939;
    --code-preprocessor: #efcd45;
    --code-keywordtype: #87bbff;
    --code-text: #b1cfb1;
    --code-code: #d3d0cc;
    --code-line: #73707c;
    --code-line-bg: #232323;
    --code-link: #b7dbff;
    /* Namespace List, Class List icon */
    --icon-bg: #303030
    --icon-font: #3771c8;
    /* Class Index */
    --qindex-menu-bg: #303030;
    --qindex-menu-font: #ffffff;
    --qindex-menu-font-hover: #3771c8;
    --qindex-icon-bg: #3771c8;
    --qindex-icon-font: #303030;
    /* Member table */
    --mem-title-bg: #3771c8;
    --mem-title-font: #ffffff;
    --mem-subtitle-bg: #77b1f8;
    --mem-subtitle-font: #303030;
    --mem-subtitle-font-hover: #303030;
    --mem-content-bg: #ffffff;
    --mem-content-font: #303030;
    --mem-content-border: grey;
    --mem-content-highlighted:#3771c8;
    /* Nav Tree */
    --nav-tree-bg: #E2E2E2;
    --nav-tree-bg-hover: #ffffff;
    --nav-tree-font: #7D7D7D;
    --nav-tree-font-hover: #303030;
    --nav-tree-bg-selected: #3771c8;
    --nav-tree-font-selected: white;
 }
 body, table, div, p, dl {
    color: var(--bgfont);
    background-color: var(--bgcolor);
    line-height: 150%;
    font: 14px/22px, Roboto, Arial;
 }
 div.contents {
    margin: 20px 40px;
 }
 div.contents ul {
    line-height: 200%;
 }
 /***********************************/
 /********** Project header *********/
 /***********************************/
 #titlearea {
    border-bottom: none;
    padding-bottom: 20px;
    padding-top: 20px;
 }
 #titlearea, #titlearea * {
    color: var(--bg1font);
    background-color: var(--bg1color);
 }
 #projectname {
    padding: 0px 40px !important;
 }
 #projectbrief {
    padding: 0px 40px !important;
 }
 #projectalign {
    padding: 0px !important;
    vertical-align: bottom;
 }
 /***********************************/
 /************ Main Menu ************/
 /***********************************/
 /* Margin */
 #main-menu {
    padding: 0px 30px;
 }
 #main-menu a, #main-menu a:hover {
    padding-top: 10px;
    padding-bottom: 10px;
 }
 /* Menu button */
 #main-menu li a {
    background-image: none;
    font-family: Arial;
    text-shadow: none;
    font-size: 14px;
    font-weight: 700;
 }
 #main-menu, #main-menu>li>a {
    background-image: none;
    background-color: var(--bg2color);
    color: var(--bg2font);
    transition: 0.2s;
 }
 /* hover Effect */
 #main-menu>li {
    border-top: 5px solid var(--bg2color);
 }
 #main-menu>li:hover {
    color: var(--bg2-hover-font);
    background-color: var(--bg2-hover-bg);
    border-top: 5px solid var(--bg2-hover-topborder);
    font-width: bold;
 }
 #main-menu>li:hover, #main-menu>li>a:hover, #main-menu>li>a.highlighted {
    color: var(--bg2-hover-font);
    background-color: var(--bg2-hover-bg);
    font-width: bold;
 }
 /* Search Bar */
 #MSearchBox {
    border-radius: 0;
    box-shadow: none;
 }
 #MSearchBox>span {
    margin: 10px;
 }
 #main-menu>li:last-child {
    padding: 25px 0px;
 }
 /* Reset search hover color*/
 #main-menu>li:last-child:hover {
    color: var(--bg2font);
    background-color: var(--bg2color);
    border-top: 5px solid var(--bg2color);
 }
 #MSearchResultsWindow {
    border: 1px solid var(--bg3font2);
    background-color: var(--bg3color);
    padding: 10px;
 }
 body.SRPage, body.SRPage * {
    font-family: Arial;
 }
 /* Sub Menu  */
 #main-menu>li ul {
    transition: max-height 0.2s ease-in-out;
    padding: 0px;
    border-radius: 0px !important;
 }
 #main-menu>li ul:before, #main-menu>li ul:after {
    border-width: 0px;
 }
 #main-menu>li>ul li a, #main-menu>li>ul li {
    background-color: var(--bgcolor);
    color: var(--bgfont);
    background-image: none;
 }
 #main-menu>li>ul li a:hover, #main-menu>li>ul li:hover {
    background-color: var(--bgfont2);
    /*color: var(--bgfont);*/
    color: white;
    font-width: bold;
 }
 /***********************************/
 /************** Header *************/
 /***********************************/
 div.headertitle {
    padding: 5px 40px;
 }
 div.header, div.header * {
    color: var(--bg3font);
    background-color: var(--bg3color);
    border-bottom: none;
 }
 div.summary {
    padding-right: 40px;
 }
 /***********************************/
 /************** Link *************/
 /***********************************/
 a, a:visited, a:active, .contents a:visited, body.SRPage a, body.SRPage a:visited, body.SRPage a:active {
    color: var(--bgfont-link);
    text-decoration: none;
 }
 a:hover, .contents a:hover, body.SRPage a:hover {
    color: var(--bgfont-hover);
    text-decoration: var(--bgfont-hover-text-decoration);
 }
 .dynheader {
    color: var(--bgfont-link);
    text-decoration: none;
 }
 .dynheader:hover {
    color: var(--bgfont-hover);
    text-decoration: var(--bgfont-hover-text-decoration);
 }
 /***********************************/
 /************ Nav-path ************/
 /***********************************/
 #nav-path, #nav-path ul {
    background-image: none;
 }
 #nav-path ul {
    padding: 5px 30px;
 }
 #nav-path, #nav-path * {
    color: var(--bg3font2);
    background-color: var(--bg3color);
    border: none;
    font-family: Arial;
 }
 li.navelem {
    background-image: url(data:image/svg+xml;base64,PHN2ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciIHZlcnNpb249IjEuMSIgeG1sbnM6eGxpbms9Imh0dHA6Ly93d3cudzMub3JnLzE5OTkveGxpbmsiIHhtbG5zOnN2Z2pzPSJodHRwOi8vc3ZnanMuY29tL3N2Z2pzIiB3aWR0aD0iNTEyIiBoZWlnaHQ9IjUxMiIgeD0iMCIgeT0iMCIgdmlld0JveD0iMCAwIDI5Mi4zNTkgMjkyLjM1OSIgc3R5bGU9ImVuYWJsZS1iYWNrZ3JvdW5kOm5ldyAwIDAgNTEyIDUxMiIgeG1sOnNwYWNlPSJwcmVzZXJ2ZSIgY2xhc3M9IiI+PGc+CjxnIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyI+Cgk8cGF0aCBkPSJNMjIyLjk3OSwxMzMuMzMxTDk1LjA3Myw1LjQyNEM5MS40NTYsMS44MDcsODcuMTc4LDAsODIuMjI2LDBjLTQuOTUyLDAtOS4yMzMsMS44MDctMTIuODUsNS40MjQgICBjLTMuNjE3LDMuNjE3LTUuNDI0LDcuODk4LTUuNDI0LDEyLjg0N3YyNTUuODEzYzAsNC45NDgsMS44MDcsOS4yMzIsNS40MjQsMTIuODQ3YzMuNjIxLDMuNjE3LDcuOTAyLDUuNDI4LDEyLjg1LDUuNDI4ICAgYzQuOTQ5LDAsOS4yMy0xLjgxMSwxMi44NDctNS40MjhsMTI3LjkwNi0xMjcuOTA3YzMuNjE0LTMuNjEzLDUuNDI4LTcuODk3LDUuNDI4LTEyLjg0NyAgIEMyMjguNDA3LDE0MS4yMjksMjI2LjU5NCwxMzYuOTQ4LDIyMi45NzksMTMzLjMzMXoiIGZpbGw9IiM3ZDdkN2QiIGRhdGEtb3JpZ2luYWw9IiMwMDAwMDAiIHN0eWxlPSIiIGNsYXNzPSIiPjwvcGF0aD4KPC9nPgo8ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciPgo8L2c+CjxnIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyI+CjwvZz4KPGcgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIj4KPC9nPgo8ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciPgo8L2c+CjxnIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyI+CjwvZz4KPGcgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIj4KPC9nPgo8ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciPgo8L2c+CjxnIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyI+CjwvZz4KPGcgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIj4KPC9nPgo8ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciPgo8L2c+CjxnIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyI+CjwvZz4KPGcgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIj4KPC9nPgo8ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciPgo8L2c+CjxnIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyI+CjwvZz4KPGcgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIj4KPC9nPgo8L2c+PC9zdmc+);
    background-size: 9px;
 }
 li.navelem a {
    margin-right: 20px;
 }
 /***********************************/
 /*************** mem ***************/
 /***********************************/
 .memtitle {
    padding: 15px;
    margin-top: 30px;
    border-top-left-radius: 0px;
    border-top-right-radius: 0px;
 }
 .memtitle, .memtitle *, .memtitle a:visited {
    border: none;
    background-image: none;
    color: var(--mem-title-font);
    background-color: var(--mem-title-bg);
 }
 .memproto {
    padding: 2em;
    text-shadow: none;
    border-top-right-radius: 0px;
    -moz-border-radius-topright: 0px;
    -webkit-border-top-right-radius: 0px;
 }
 .memproto, .memproto *, .memproto a:visited {
    border: none;
    background-image: none;
    background-color: var(--mem-subtitle-bg);
    color: var(--mem-subtitle-font);
    font-size: inherit;
    line-height: 100%
 }
 .memproto a:hover {
    color: var(--mem-subtitle-font-hover);
 }
 .memdoc {
    border-bottom: 1px solid var(--mem-content-border);
    border-left: 1px solid var(--mem-content-border);
    border-right: 1px solid var(--mem-content-border);
    background-color: var(--mem-content-bg);
    color: var(--mem-content-font);
    border-bottom-left-radius: 0px;
    border-bottom-right-radius: 0px;
    -moz-border-radius-bottomleft: 0px;
    -moz-border-radius-bottomright: 0px;
    -webkit-border-bottom-left-radius: 0px;
    -webkit-border-bottom-right-radius: 0px;
    padding:1em;
 }
 .memdoc p, .memdoc dt {
    /*padding: 0px 20px;*/
 }
 .memdoc > p {
    font-size:1em;
 }
 .paramname {
    color:black;
 }
 td.memItemRight > a:first-of-type {
    font-size:1.3em;
 }
 /***********************************/
 /************* Contents ************/
 /***********************************/
 a.anchor {
    padding-top: 20px;
 }
 dl {
    border-left: 5px solid;
    padding:1em;
 }
 dt {
    font-variant-caps: small-caps;
 }
 dl.warning {
    border-top: thin solid red;
    border-right: thin solid red;
    border-bottom: thin solid red;
    border-left-color: red;
    background-color: #fee;
 }
 dl.warning > dt {
    color: #500;
 }
 dl.note {
    border-top:thin solid green;
    border-right:thin solid green;
    border-bottom:thin solid green;
    border-left-color:green;
    background-color: #efe;
 }
 dl.note > dt {
    color: #050;
 }
 div.textblock {
    padding:2em;
    border: 2px solid var(--bgfont2);
    box-shadow:0.5em 0.5em 0.5em var(--bgfont);
    background-color: #fafaff;
 }
 div.textblock > p {
    font-size:1.2em;
 }
 div.textblock > p.definition {
    font-size:0.8em;
 }
 p.definition {
    font-size: 0.8em;
 }
 p.reference {
    font-size: 0.8em;
 }
 p {
    background-color: transparent;
 }
 table {
    margin-top:4em;
 }
 table.memname {
    margin-top:0.1em;
 }
 table.mlabels {
    margin-top:0.1em;
 }
 /***********************************/
 /************* fragment ************/
 /***********************************/
 h2.groupheader {
    color: #303030;
    font-size: 200%;
    font-weight: bold;
    border-bottom: thin solid var(--bgfont2);
    padding-bottom:1px;
    margin-top:3em;
 }
 h3 {
    background-color:var(--bgfont2);
    color: var(--bgcolor);
    font-size: 1.5em;
    margin:0px;
    padding:1em;
    margin-bottom:2em;
    border: 2px solid var(--bgfont2);
    box-shadow:0.5em 0.5em 0.5em var(--bgfont);
    font-family:monospace;
 }
 div.fragment, pre.fragment {
    border: none;
    padding: 1em;
    margin-left: 1em;
    margin-right: 1em;
    background-color: var(--code-bg);
    border-left: 2px solid black;
    border-top: 2px solid black;
    border-right: 2px solid grey;
    border-bottom: 2px solid grey;
 }
 div.fragment > div.line {
    font-size:1em;
    line-height:150%;
    color: var(--code-code);
 }
 .textblock > div.fragment {
    font-size: 1em;
 }
 .textblock > dl.section {
    font-size: 1.2em;
 }
 div.line {
    background-color: var(--code-bg);
 }
 span.comment {
    color: var(--code-comment);
 }
 span.keyword {
    color: var(--code-keyword);
 }
 span.preprocessor {
    color: var(--code-preprocessor);
 }
 span.keywordtype {
    color: var(--code-keywordtype);
 }
 span.stringliteral {
    color: var(--code-text);
 }
 span.mlabel {
    background-color: var(--code-text);
    color: var(--code-bg);
    border-top: none;
    border-left: none;
    border-right: none;
    border-bottom: none;
    padding: 10px;
    border-radius: 0px;
 }
 div.fragment > div.line > a.code {
    color: var(--code-link);
 }
 span.lineno, span.lineno>* {
    color: var(--code-line);
    border-right: none;
    background-color: var(--code-bg);
 }
 span.lineno a {
    background-color: var(--code-line-bg);
 }
 span.lineno a:hover {
    color: var(--bg3font);
    background-color: var(--code-line-bg);
 }
 code {
    color:black;
 }
 /***********************************/
 /************* directory ***********/
 /***********************************/
 .directory tr.even {
    background-color: inherit;
 }
 .iconfclosed {
    background-image: url(closed-folder.png);
    margin-right: 10px;
 }
 .iconfopen {
    background-image: url(opened-folder.png);
    margin-right: 10px;
 }
 .icondoc {
    background-image: url(document.png);
    margin-right: 10px;
 }
 .arrow {
    color: #7d7d7d;
 }
 .icona {
    vertical-align: middle;
    margin-right: 5px;
 }
 .icon {
    background-color: var(--icon-bg);
    color: var(--icon-font);
    display: table-cell;
    vertical-align: middle;
    height: 20px;
    width: 20px;
 }
 div.ah {
    background-color: var(--qindex-icon-bg);
    color: var(--qindex-icon-font);
    text-align: center;
    background-image: none;
    -webkit-box-shadow: none;
    box-shadow: none;
    -webkit-border-radius: 0px;
    border-radius: 0px;
    border: none;
 }
 div.qindex {
    background-color: var(--qindex-menu-bg);
    border: none;
    padding: 20px;
 }
 a.qindex {
    color: var(--qindex-menu-font);
    font-weight: normal;
    font-size: 20px;
 }
 a:hover.qindex {
    color: var(--qindex-menu-font-hover);
 }
 a:visited.qindex {
    color: var(--qindex-menu-font);
 }
 table.classindex {
    margin-top: 30px;
    margin-bottom: 30px;
 }
 table.classindex a.el {
    font-weight: normal;
 }
 table.params {
    margin-top:1em;
 }
 #titlearea > table {
    margin-top:0px;
 }
 table.directory > tbody > tr {
    border-top: thin solid var(--nav-tree-bg);
    border-bottom: thin solid var(--nav-tree-bg);
 }
 /***********************************/
 /************** footer *************/
 /***********************************/
 div.directory {
    border-top: 1px solid var(--bgborder);
    border-bottom: none;
    margin: 20px 0px;
 }
 div.directory a.el {
    font-weight: normal;
 }
 div.directory>table {
    margin: 20px 0px;
 }
 hr.footer {
    border: none;
 }
 .contents>hr {
    border-top: 0px;
 }
 /***********************************/
 /*********** memberdecls ***********/
 /***********************************/
 .memItemLeft, .memItemRight {
    padding: 15px 30px;
    background-color: inherit;
 }
 .mdescRight {
    padding: 0px 30px 10px 30px;
 }
 .memberdecls * {
    background-color: inherit;
 }
 .memSeparator {
    border-bottom: 1px solid var(--bgborder2);
 }
 .memTemplParams {
    color: var(--bgfont);
 }
 /***********************************/
 /*********** nav-tree ***********/
 /***********************************/
 #nav-tree-contents {
    background-color: var(--nav-tree-bg);
    margin: 0px;
 }
 #side-nav, #nav-tree {
    background-image: none;
    background-color: var(--nav-tree-bg);
 }
 #nav-tree .item {
    background-color: var(--nav-tree-bg);
    font-family: Arial;
    text-shadow: none;
    font-size: 14px;
    font-weight: 700;
    padding: 10px;
    color: var(--nav-tree-font);
 }
 #nav-tree .arrow {
    color: var(--nav-tree-font);
 }
 #nav-tree .selected {
    background-image: none;
    background-color: var(--nav-tree-bg-selected);
 }
 #nav-tree .selected a {
    color: var(--nav-tree-font-selected);
 }
 #nav-tree .item:hover {
    background-color: var(--nav-tree-bg-hover);
    color: var(--nav-tree-font-hover);
 }
 #nav-tree .item a:hover {
    color: var(--nav-tree-font-hover);
 }
 #side-nav .ui-resizable-e {
    background-image: none;
    background-color: var(--nav-tree-bg);
 }
 #nav-sync {
    background-color: transparent;
 }
 #nav-sync>img {
    content: url(off_sync.png);
 }
 #nav-sync.sync>img {
    content: url(on_sync.png);
 }
 /***********************************/
 /*********** Plant UML ***********/
 /***********************************/
 .plantumlgraph > img {
    width: 80%;
 }
--- a/edo/LICENSE
+++ b/edo/LICENSE
@ -1,502 +0,0 @@
 		  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.
    <one line to give the library's name and a brief idea of what it does.>
    Copyright (C) <year>  <name of author>
    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Lesser General Public
    License as published by the Free Software Foundation; either
    version 2 of the License, or (at your option) any later version.
    This library is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
    Lesser General Public License for more details.
    You should have received a copy of the GNU Lesser General Public
    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.
  <signature of Ty Coon>, 1 April 1990
  Ty Coon, President of Vice
 That's all there is to it!
--- a/edo/doc/CMakeLists.txt
+++ b/edo/doc/CMakeLists.txt
@ -22,8 +22,7 @@ if(DOXYGEN_FOUND)
                              )
        endif(UNIX AND NOT ${CMAKE_VERBOSE_MAKEFILE})
    endif(DOXYGEN_EXECUTABLE)
-    # configure_file("${CMAKE_CURRENT_SOURCE_DIR}/${EDO_DOC_CONFIG_FILE}.cmake"
+    configure_file("${CMAKE_CURRENT_SOURCE_DIR}/${EDO_DOC_CONFIG_FILE}.cmake"
    configure_file("${DOXYGEN_CONFIG_DIR}/doxyfile.cmake"
        "${EDO_DOC_DIR}/${EDO_DOC_CONFIG_FILE}")
    install(
        DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}
--- a/edo/doc/edo.doxyfile.cmake
+++ b/edo/doc/edo.doxyfile.cmake
@ -25,13 +25,13 @@ DOXYFILE_ENCODING      = UTF-8
 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded
 # by quotes) that should identify the project.
-PROJECT_NAME           = @EDO_MODULE_NAME@
+PROJECT_NAME           = @PACKAGE_NAME@
 # 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         = @PROJECT_VERSION@
+PROJECT_NUMBER         = @PACKAGE_VERSION@
 # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
 # base path where the generated documentation will be put.
@ -1030,7 +1030,7 @@ SERVER_BASED_SEARCH    = NO
 # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
 # generate Latex output.
-GENERATE_LATEX         = NO
+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
--- a/edo/src/edoEstimatorAdaptive.h
+++ b/edo/src/edoEstimatorAdaptive.h
@ -45,7 +45,7 @@ class edoEstimatorAdaptive : public edoEstimator<D>
 public:
    typedef typename D::EOType EOType;
-    edoEstimatorAdaptive( D& distrib ) : _distrib(distrib) {}
+    edoEstimatorAdaptive<D>( D& distrib ) : _distrib(distrib) {}
    // virtual D operator() ( eoPop< EOT >& )=0 (provided by eoUF< A1, R >)
--- a/edo/src/edoEstimatorAdaptiveReset.h
+++ b/edo/src/edoEstimatorAdaptiveReset.h
@ -41,12 +41,12 @@ class edoEstimatorAdaptiveReset : public edoEstimatorAdaptive<D>
 public:
    typedef typename D::EOType EOType;
-    edoEstimatorAdaptiveReset( D& distrib ) :
+    edoEstimatorAdaptiveReset<D>( D& distrib ) :
        edoEstimatorAdaptive<D>(distrib),
        _dim(0)
    { }
-    edoEstimatorAdaptiveReset( D& distrib, size_t dim ) :
+    edoEstimatorAdaptiveReset<D>( D& distrib, size_t dim ) :
        edoEstimatorAdaptive<D>(distrib),
        _dim(dim)
    { }
--- a/edo/src/edoEstimatorCombined.h
+++ b/edo/src/edoEstimatorCombined.h
@ -43,12 +43,12 @@ class edoEstimatorCombinedAdaptive : public edoEstimatorAdaptive<D>, public std:
 public:
    typedef typename D::EOType EOType;
-    edoEstimatorCombinedAdaptive( D& distrib, edoEstimator<D>& estim) :
+    edoEstimatorCombinedAdaptive<D>( D& distrib, edoEstimator<D>& estim) :
        edoEstimatorAdaptive<D>(distrib),
        std::vector<edoEstimator<D>*>(1,&estim)
    {}
-    edoEstimatorCombinedAdaptive( D& distrib, std::vector<edoEstimator<D>*> estims) :
+    edoEstimatorCombinedAdaptive<D>( D& distrib, std::vector<edoEstimator<D>*> estims) :
        edoEstimatorAdaptive<D>(distrib),
        std::vector<edoEstimator<D>*>(estims)
    {}
@ -78,11 +78,11 @@ class edoEstimatorCombinedStateless : public edoEstimatorCombinedAdaptive<D>
 public:
    typedef typename D::EOType EOType;
-    edoEstimatorCombinedStateless( edoEstimator<D>& estim ) :
+    edoEstimatorCombinedStateless<D>( edoEstimator<D>& estim ) :
        edoEstimatorCombinedAdaptive<D>(*(new D), estim)
    {}
-    edoEstimatorCombinedStateless( std::vector<edoEstimator<D>*> estims) :
+    edoEstimatorCombinedStateless<D>( std::vector<edoEstimator<D>*> estims) :
        edoEstimatorCombinedAdaptive<D>(*(new D), estims)
    {}
--- a/edo/src/edoEstimatorNormalAdaptive.h
+++ b/edo/src/edoEstimatorNormalAdaptive.h
@ -233,7 +233,7 @@ public:
            Matrix mD = eigensolver.eigenvalues().asDiagonal();
            // from variance to standard deviations
-            mD=mD.cwiseSqrt();
+            mD.cwiseSqrt();
            d.scaling( mD.diagonal() );
            d.coord_sys( eigensolver.eigenvectors() );
--- a/edo/src/edoRepairerModulo.h
+++ b/edo/src/edoRepairerModulo.h
@ -39,7 +39,7 @@ template < typename EOT >
 class edoRepairerModulo: public edoRepairerApplyBinary<EOT>
 {
 public:
-    edoRepairerModulo( double denominator ) : edoRepairerApplyBinary<EOT>( std::fmod, denominator ) {}
+    edoRepairerModulo<EOT>( double denominator ) : edoRepairerApplyBinary<EOT>( std::fmod, denominator ) {}
 };
--- a/edo/src/utils/edoFileSnapshot.cpp
+++ b/edo/src/utils/edoFileSnapshot.cpp
@ -76,7 +76,8 @@ edoFileSnapshot::edoFileSnapshot(std::string dirname,
 	    s = " ";
 	}
-    (void)/*ignore returned*/ system(s.c_str());
+    int dummy;
    dummy = system(s.c_str());
    // all done
    _descOfFiles = new std::ofstream( std::string(dirname + "/list_of_files.txt").c_str() );
--- a/Show more
+++ b/Show more