EvalOp.cpp

#include <cmath>
#include <ecf/ECF.h>
#include "EvalOp.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <iostream>
#include <string>
using namespace std;
 
 
// from WriteTT.h
extern bool evaluateVerbose;
 
 
//
// ispis u infix formatu
//
uint EvalOp::showTree(string& output, Tree::Tree* tree, uint iNode, uint prefix)
{
    Tree::PrimitiveP prim = tree->at(iNode)->primitive_;
    int arity = prim->getNumberOfArguments();
 
    if(arity == 0) {
        output += prim->getName();
    }
    else if(prim->getName() == "P2") {
        output += "P2(";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += ", ";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += ")";
    }
    else if(prim->getName() == "IF") {
        output += "IF(";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += ", ";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += ", ";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += ")";
    }
    else if(prim->getName() == "ADD" ||
        prim->getName() == "AND" ||
        prim->getName() == "AND2" ||
        prim->getName() == "XOR" ||
        prim->getName() == "XNOR" || 
        prim->getName() == "OR") {
        output += "(";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += " " + prim->getName() + " ";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += ")";
    }
    else if(prim->getName() == "MUL") {
        output += "(";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += " * ";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += ")";
    }
    else if(prim->getName() == "NOT") {
        output += "~";
        output += "(";
        for(int child = 0; child < arity; child++) {
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        }
        output += ")";
    }
    else if(arity == 2) {
        output += "(";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += " "  + prim->getName() + " ";
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        output += ")";
    }
    else if(arity == 1) {
        output += prim->getName();
        output += "(";
        for(int child = 0; child < arity; child++) {
            iNode++;
            iNode = showTree(output, tree, iNode, prefix);
        }
        output += ")";
    }
    return iNode;
}
 
 
 
void EvalOp::registerParameters(StateP state)
{
    state->getRegistry()->registerEntry("variables", (voidP) (new uint(1)), ECF::UINT);
    state->getRegistry()->registerEntry("variant", (voidP) (new int(1)), ECF::INT);
    state->getRegistry()->registerEntry("nelinearnost", (voidP) (new int(0)), ECF::INT);
}
 
 
bool EvalOp::initialize(StateP state)
{
    state_ = state;
    showTruth = false;
    inputNames.clear();
    inputMap.clear();
 
    voidP sptr = state->getRegistry()->getEntry("variables");
    nVariables = *((uint*)sptr.get());
 
    sptr = state->getRegistry()->getEntry("variant");
    varijanta = *((int*)sptr.get());
 
    sptr = state->getRegistry()->getEntry("nelinearnost");
    targetNl = *((int*)sptr.get());
 
 
    for(uint var = 0; var < nVariables; var++)
        inputNames.push_back("v" + uint2str(var));
 
    // izgradi potpunu tablicu kombinacija ulaznih varijabli
    inputMap.resize(nVariables);
    bool t = true, f = false, val;
    uint tries = (uint) pow(2., (int) nVariables);
 
    results.resize(tries);
    tt.resize(tries);
    anfPos.resize(tries);
 
    for(uint count = 0; count < tries; count++) {
        uint mask = count;
        for(uint var = 0; var < nVariables; var++) {
            if(mask % 2)
                val = true;
            else
                val = false;
            mask /= 2;
            inputMap[var].push_back(val);
        }
    }
 
    // zadaj vrijednosti obicnim varijablama (ne mijenjaju se tijekom evolucije!)
    Tree::Tree* tree = (Tree::Tree*) state->getGenotypes().at(0).get();
    for (uint var = 0; var < (nVariables); var++) {
        tree->setTerminalValue(inputNames[var], &inputMap[var]);
    }
 
 
    return true;
}
 
 
// obicna verzija fitnesa
FitnessP EvalOp::evaluate(IndividualP individual)
{
    // greater fitness means better individual
    FitnessP fitness (new FitnessMax);
 
    // get tree from the individual
    Tree::Tree* tree = (Tree::Tree*) individual->getGenotype().get();
 
    // build TT
    tree->execute(&results);
 
    // ako treba prijepis u int
    uint tries = (uint) tt.size();
    for(uint i = 0; i < tries; i++) {
        tt[i] = results[i];
    }
 
 
 
 
    fitness->setValue(0);
 
    if(evaluateVerbose) {
        ECF_LOG(state_, 1, "Truth table:");
        stringstream ss;
        for(uint i = 0; i < tt.size(); i++)
            ss << tt[i];// << " ";
        ss << endl;
        string output;
        showTree(output, tree);
        ss << "infix: " << output;
        ECF_LOG(state_, 1, ss.str());
 
        // ispis TT u datoteku (ako treba)
        ofstream out("funkcije.txt", ios_base::app);
        for (uint i = 0; i < tt.size(); i++)
            out << tt[i];
        out << endl;
        out.close();
    }
 
    return fitness;
}