code.hpp

#pragma once

#include <SFML/Graphics.hpp>
#include <bits/stdc++.h>
#include "Constants.hpp"
#include "Evaluare.hpp"
#include "Node.hpp"
#include "Buttons.hpp"
using namespace sf;
using namespace std;

string code = "Code:\n";
string tabb =  "      ";
int nr_tabs = 1;
void putTabs()
{
    for(int i = 1; i <= nr_tabs; ++i)
        code += tabb;
}

void CodeSchema(Node *p, Node *stopp);
void DFS(Node *p, int q, Node *&tata, int &whileBranch, Node *&common)
{
    if(p == NULL) return;
    if(p == tata)
    {
        cout << "SUCCES \n";
        common = tata;
        if(whileBranch == 0)
            whileBranch = q + 1;
//        if(tata->nodeType == Constants::NodeType::ConditionalNode)
        return;
    }
    if(p->vizT && p->vizF)
    {
        common = p;
        return;
    }
    if( (q == 0 && p->vizT == 1) || (q == 1 && p->vizF == 1) || common!= NULL)
        return;
    cout << p->content << ' ' << tata->content << '\n';
    if(q == 0)
        p->vizT = 1;
    else
        p->vizF = 1;

    cout << p->content << p->vizT << ' ' << p->vizF << '\n';
    if(p->vizT && p->vizF)
    {
        common = p;
        return;
    }
    if(p->nodeType == Constants::NodeType::ConditionalNode)
    {
        DFS(p->urmTrue, q, tata,whileBranch,common);
        DFS(p->urmFalse, q, tata,whileBranch,common);
    }
    else
        DFS(p->urm, q,tata,whileBranch,common);

}

Node* PrintStartNode(Node *p)
{
    return p->urm;
}
Node* PrintAssignNode(Node *p)
{
    putTabs();
    for(int i = 0; i < strlen(p->content); ++i)
        code += p->content[i];
    code += ";\n";
    return p->urm;
}
Node* PrintIfNode(Node *p)
{
    cout << "FAC NODUL " << p->content << '\n';
    Node* common1;
    Node* common2;
    for(int i = 0; i < nodes.size(); ++i)
    {
        nodes[i]->vizF = 0;
        nodes[i]->vizT = 0;
    }
    Node *tata = p;
    common1 = common2 = NULL;
    int whileBranch = 0;
    DFS(p->urmTrue, 0,p,whileBranch,common1);
    DFS(p->urmFalse, 1,p,whileBranch,common2);

    if(common1 == common2 && common1 != NULL) whileBranch = 0;
    cout << "BRANCH: " << whileBranch << " " << p->content << '\n';
    if(common1)
        cout << "COMMON 1 " << common1 ->content << '\n';
    if(common2)
        cout << "COMMON 2 " <<  common2 ->content << '\n';
    if(common1 && (common1 ->urm == p || common1 ->urmTrue == p || common1 ->urmFalse == p)) whileBranch = 0;
    if(common2 && (common2 ->urm == p || common2 ->urmTrue == p || common2 ->urmFalse == p)) whileBranch = 0;
    if(common1 == common2 && common1 == p) whileBranch = 1;
    cout << (common1 == p) << '\n';
    if(whileBranch)
    {
        cout << whileBranch << ' ' <<"WHILE!!!!\n";
        putTabs();
        code += "while(";
        for(int i = 0; i < strlen(p->content); ++i)
            code += p->content[i];
        code += ")\n";
        putTabs();
        code += "{\n";
        nr_tabs++;
        if(whileBranch == 1)
        {
            cout << p->urmTrue->content << '\n';
            cout << p->content << '\n';
            CodeSchema( p->urmTrue, p);
        }
        else
            CodeSchema( p->urmFalse, p);
        nr_tabs--;
        putTabs();
        code += "}\n";
        if(whileBranch == 1)
        {
            if(p->urmFalse->viz) return nullptr;
            return p->urmFalse;
        }
        else
        {
            if(p->urmTrue->viz) return nullptr;
            return p->urmTrue;
        }
    }
    putTabs();
    code += "if(";
    for(int i = 0; i < strlen(p->content); ++i)
        code += p->content[i];
    code += ")\n";
    putTabs();
    code += "{\n";
    nr_tabs++;
    CodeSchema( p->urmTrue, common1);
    nr_tabs--;
    putTabs();
    code += "}\n";

    putTabs();
    code+= "else{\n";
    nr_tabs++;
    CodeSchema( p->urmFalse, common1);
    nr_tabs--;
    putTabs();
    code += "}\n";

    return common1;
}
Node* PrintPrintNode(Node *p)
{
    putTabs();
    code += "cout << ";

    for(int i = 0; i < strlen(p->content); ++i)
        code += p->content[i];
    code += " << '\\n';\n";
    return p->urm;
}
Node* PrintReadNode(Node *p)
{
    putTabs();
    code += "cin >> ";

    for(int i = 0; i < strlen(p->content); ++i)
        code += p->content[i];
    code += ";\n";
    return p->urm;
}


Node* RunNode2(Node *p)
{
    if(p->viz) return nullptr;
    p->viz = true;
    if(p->nodeType == 1)
        return PrintStartNode(p);
    if(p->nodeType == 2)
        return PrintAssignNode(p);
    if(p->nodeType == 3)
        return PrintIfNode(p);
    if(p->nodeType == 4)
        return PrintPrintNode(p);
    if(p->nodeType == 6)
        return PrintReadNode(p);
    return nullptr;
}

void CodeSchema(Node *p, Node *stopp)
{
    while(p != stopp && p != NULL)
    {
        p = RunNode2(p);
    }
}
void writeCode(Node *p)
{
    for(auto it : nodes)
    {
        it->viz = false;
        if(strstr(it->content, "pow"))
            is_expo = 1;
    }
    CodText.setCharacterSize(10);
    code = "#include<iostream>\n#include<cmath>\nusing namespace std;\n";
    if(is_expo)
        code += "double pow(double a, double b)\n{\n    double r = 1;\n    int b_floored = b;\n    if(b - b_floored >= 0.00001)\n    {\n        perror(\"Exponentiala cu exponent real\");\n        exit(1);\n    }\n    if(b_floored < 0)\n    {\n        a = 1 / a;\n        b_floored = -b_floored;\n    }\n    while(b_floored)\n    {\n        if(b_floored & 1) r *= a;\n        a *= a;\n        b_floored >>= 1;\n    }\n    return r;\n}";
    bool amVars = 0;
    for(auto it : nodes)
            if(it->nodeType == Constants::NodeType::ReadNode || it->nodeType == Constants::NodeType::AssignNode )
            {
                amVars = 1;
                break;
            }
    if(amVars)
    {
        code += "double";
        map <string, bool> isIn;
        for(auto it : nodes)
            if(it->nodeType == Constants::NodeType::ReadNode || it->nodeType == Constants::NodeType::AssignNode )
            {
                string varr;
                for(int i = 0; i < strlen(it->content); ++i)
                {
                    if(it->content[i] == '=') break;
                    if(it->content[i] != ' ')
                        varr += it->content[i];
                }
                if(isIn.find(varr) == isIn.end())
                {
                    isIn[varr] = 1;
                    code += " " + varr + ",";
                }

            }
        /*
        for(auto it : variabileCod)
            code += " " + it.first + ",";
        */
        code.pop_back();
        code += ";";
    }
    code += "\nint main()\n{\n";
    CodeSchema(StartSchema, NULL);
    code += "      return 0;\n}";
    CodText.setString(code);
    is_expo = 0;
    ofstream CodeFile("CodC++.cpp");
    CodeFile << code;
    CodeFile.close();
}

void copyToClipboard() {
    Clipboard().setString(code);
}