/* Routines for storing population data into files */

 # include <stdio.h>

 # include <stdlib.h>

 # include <math.h>

 # include "global.h"

 # include "rand.h"

 /* Function to print the information of a population in a file */

 void report_pop (population *pop, FILE *fpt)

 {

     int i, j, k;

     for (i=; i<popsize; i++)

     {

         for (j=; j<nobj; j++)

         {

             fprintf(fpt,"%e\t",pop->ind[i].obj[j]);

         }

         if (ncon!=)

         {

             for (j=; j<ncon; j++)

             {

                 fprintf(fpt,"%e\t",pop->ind[i].constr[j]);

             }

         }

         if (nreal!=)

         {

             for (j=; j<nreal; j++)

             {

                 fprintf(fpt,"%e\t",pop->ind[i].xreal[j]);

             }

         }

         if (nbin!=)

         {

             for (j=; j<nbin; j++)

             {

                 for (k=; k<nbits[j]; k++)

                 {

                     fprintf(fpt,"%d\t",pop->ind[i].gene[j][k]);

                 }

             }

         }

         fprintf(fpt,"%e\t",pop->ind[i].constr_violation);

         fprintf(fpt,"%d\t",pop->ind[i].rank);

         fprintf(fpt,"%e\n",pop->ind[i].crowd_dist);

     }

     return;

 }

 /* Function to print the information of feasible and non-dominated population in a file */

 void report_feasible (population *pop, FILE *fpt)

 {

     int i, j, k;

     for (i=; i<popsize; i++)

     {

         if (pop->ind[i].constr_violation == 0.0 && pop->ind[i].rank==)

         {

             for (j=; j<nobj; j++)

             {

                 fprintf(fpt,"%e\t",pop->ind[i].obj[j]);

             }

              if (ncon!=)

             {

                 for (j=; j<ncon; j++)

                 {

                     fprintf(fpt,"%e\t",pop->ind[i].constr[j]);

                 }

             }

             if (nreal!=)

             {

                 for (j=; j<nreal; j++)

                 {

                     fprintf(fpt,"%e\t",pop->ind[i].xreal[j]);

                 }

             }

             if (nbin!=)

             {

                 for (j=; j<nbin; j++)

                 {

                     for (k=; k<nbits[j]; k++)

                     {

                         fprintf(fpt,"%d\t",pop->ind[i].gene[j][k]);

                     }

                 }

             }

             fprintf(fpt,"%e\t",pop->ind[i].constr_violation);

             fprintf(fpt,"%d\t",pop->ind[i].rank);

             fprintf(fpt,"%e\n",pop->ind[i].crowd_dist);

         }

     }

     return;

 }