archive.h

Go to the documentation of this file.

#ifndef ARCHIVE_H
#define ARCHIVE_H
 
#include "../ind/individual.h"

#include "../selection/nsga2.h"
 
namespace Brush{
 
using namespace Sel;
 
namespace Pop{
    
template<ProgramType T> 
struct Archive  
{
    vector<Individual<T>> individuals; 
    bool sort_complexity;    
    bool linear_complexity;  
    NSGA2<T> selector;       

    Archive();

    void init(Population<T>& pop);

    void update(Population<T>& pop, const Parameters& params);

    void set_objectives(vector<string> objectives);

    static bool sortComplexity(const Individual<T>& lhs, const Individual<T>& rhs);
 
    static bool sortLinearComplexity(const Individual<T>& lhs, const Individual<T>& rhs);

    static bool sortObj1(const Individual<T>& lhs, const Individual<T>& rhs);

    static bool sameObjectives(const Individual<T>& lhs, const Individual<T>& rhs);
};
 
extern template struct Archive<PT::Regressor>;
extern template struct Archive<PT::BinaryClassifier>;
extern template struct Archive<PT::MulticlassClassifier>;
extern template struct Archive<PT::Representer>;
 
//serialization
NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Archive<PT::Regressor>, individuals, sort_complexity, linear_complexity);
NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Archive<PT::BinaryClassifier>, individuals, sort_complexity, linear_complexity);
NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Archive<PT::MulticlassClassifier>, individuals, sort_complexity, linear_complexity);
NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Archive<PT::Representer>, individuals, sort_complexity, linear_complexity);
 
} // Pop
} // Brush
 
#endif