//
// Created by tudor on 07/01/24.
//

#ifndef C___NSGA_ONEMINMAXBENCHMARK_CPP
#define C___NSGA_ONEMINMAXBENCHMARK_CPP

#include "Benchmark.h"
#include <set>
#include <iostream>

class OneMinMaxBenchmark : public Benchmark<2>{
public:
    int PARETO_FRONT_SIZE = n + 1;

    OneMinMaxBenchmark(int _n) : Benchmark(_n) {}


    bool is_pareto_front_complete(const std::vector<std::shared_ptr<Individual>> &pop) override {
        std::set<std::array<int, 2>> values;
        for(int i = 0; i < pop.size(); i++){
            values.insert(getCompute(pop[i]));
        }
        //std::cerr<<"Pareto front is: "<<values.size()<<" out of "<<PARETO_FRONT_SIZE<<std::endl;
        if(values.size() == PARETO_FRONT_SIZE)
            return true;
        return false;
    }
private:
    std::array<int, 2> compute(const Individual &x) override{
        //fitness_function_calls ++;
        std::array<int, 2> ans = {0, 0};
        for(int i = 0; i < n; i++){
            if(x.bits[i] == 0)
                ans[0]++;
            else
                ans[1]++;
        }
        return ans;
    }

};

#endif