candidate.h

#ifndef CANDIDATE_H
#define CANDIDATE_H
#include <stdexcept>
#include <cstring>

using namespace std;

class Candidate {

        friend class OptAlg;

    public:
        Candidate() {
            is_velocity_initialized = false;
            is_candidate_initialized = false;
            };
        ~Candidate();

        void init_can(int numvar, int fit_size);
        void init_velocity();
        void update_cont(double *input); 
        void update_vel(double *input); 
        void update_best(); 
        void update_global(double *input);  
        void put_to_global(); 
        void read_cont(double *output); 
        void read_vel(double *output); 
        void read_best(double *output); 
        void read_global(double *output); 
        void write_contfit(double *fit, int tt); 
        void write_bestfit(double *fit); 
        void write_globalfit(double *fit); 
        double read_contfit(int i ) { 
            return cont_fit[i];
            }
        double read_bestfit(int i ) {
            return best_fit[i];
            }
        double read_globalfit(int i ) {
            return global_fit[i];
            }
        int read_bestt() {
            return best_times;
            }


    private:

        int num; /*number of variables*/
        int num_fit; /*number of fitness values (i.e., total number of contraints and objetive functions)*/
        double *best_fit; /*pointer to array for storing fitness values calculated from the data in contender array*/
        double *cont_fit; /*pointer to array for storing fitness values calculated from the data in can_best array*/
        double *global_fit; /*pointer to array for storing fitness values calculated from the data in global_best array*/
        int times; /*the number of time the fitess value is computed for contender*/
        int best_times; /*the number of time the fitess value is computed for can_best*/
        int global_times; /*the number of time the fitess value is computed for global_best*/
        bool is_velocity_initialized; /*indicating whether addition memory needs to be allocated*/
        bool is_candidate_initialized; /*indicating whether memories are allocated*/

        //memory arrays
        double *can_best; /*the pointer to array that contains solution that would survive several iterations*/
        double *contender; /*the pointer to array that serves mostly as temporary memory that does not survive an interation*/
        double *velocity; /*the pointer to additional array*/
        double *global_best; /*the pointer to array that contains solution to be compared for the final solution*/
    };

#endif // CANDIDATE_H