population.h

Go to the documentation of this file.

/* FEAT
copyright 2017 William La Cava
license: GNU/GPL v3
*/
#ifndef POPULATION_H
#define POPULATION_H
 
//#include "node.h" // including node.h since definition of node is in the header
#include "individual.h"
using std::vector;
using std::string;
using Eigen::Map;
 
namespace FT{ 
 
namespace Pop{   
extern int last;
struct Population
{
    vector<Individual> individuals;     
 
    Population(int p = 0);
    
    ~Population();
    
    void init(const Individual& starting_model, 
              const Parameters& params, 
              bool random = false,
              string filename=""
              );
    
    void resize(int pop_size);
    
    void update(vector<size_t> survivors);
    
    int size();
 
    void add(Individual&);
    
    const Individual operator [](size_t i) const;
    
    const Individual & operator [](size_t i);
 
    string print_eqns(bool just_offspring=false, string sep="\n");
 
    vector<size_t> sorted_front(unsigned);
    
    struct SortComplexity
    {
        Population& pop;
        SortComplexity(Population& p): pop(p){}
        bool operator()(size_t i, size_t j)
        { 
            return pop.individuals[i].set_complexity() < pop.individuals[j].set_complexity();
        }
    };
    
    struct SameFitComplexity
    {
        Population & pop;
        SameFitComplexity(Population& p): pop(p){}
        bool operator()(size_t i, size_t j)
        {
            return (pop.individuals[i].fitness == pop.individuals[j].fitness &&
                   pop.individuals[i].set_complexity() == pop.individuals[j].set_complexity());
        }
    };
 
    // save serialized population
    void save(string filename);
    // load serialized population
    void load(string filename);
 
};        
//TODO
/* void from_json(const json& j, Population& p); */
/* void to_json(json& j, const Population& p); */
NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Population, individuals);
}//Pop
}//FT    
#endif