/*
This Source Code Form is subject to the
terms of the Mozilla Public License, v.
2.0. If a copy of the MPL was not
distributed with this file, You can
obtain one at
http://mozilla.org/MPL/2.0/.
*/
/*
MaSzyna EU07 - SPKS
Brakes.
Copyright (C) 2007-2014 Maciej Cierniak
*/
#include "mctools.h"
#include <cmath>
#include <fstream>

using namespace std;
/*================================================*/

//std::string Ups(std::string s)
//{
//    int jatka;
//    std::string swy;
//
//    swy = "";
//    {
//        long jatka_end = s.length() + 1;
//        for (jatka = 0; jatka < jatka_end; jatka++)
//            swy = swy + UpCase(s[jatka]);
//    }
//    return swy;
//} /*=Ups=*/

int Max0(int x1, int x2)
{
    if (x1 > x2)
        return x1;
    else
        return x2;
}

int Min0(int x1, int x2)
{
    if (x1 < x2)
        return x1;
    else
        return x2;
}

double Max0R(double x1, double x2)
{
    if (x1 > x2)
        return x1;
    else
        return x2;
}

double Min0R(double x1, double x2)
{
    if (x1 < x2)
        return x1;
    else
        return x2;
}

int Sign(double x)
{
    if (x > 0)
        return 1;
    else if (x < 0)
        return -1;
    return 0;
}

bool TestFlag(int Flag, int Value)
{
    if ((Flag & Value) == Value)
        return true;
    else
        return false;
}

bool SetFlag(int &Flag, int Value)
{
	return iSetFlag(Flag, Value);
}

bool iSetFlag(int &Flag, int Value)
{
    if (Value > 0)
        if ((Flag & Value) == 0)
        {
            Flag |= Value;
            return true; // true, gdy było wcześniej 0 i zostało ustawione
        }
    if (Value < 0)
        if ((Flag & abs(Value)) == abs(Value))
        {
            Flag |= Value; // Value jest ujemne, czyli zerowanie flagi
            return true; // true, gdy było wcześniej 1 i zostało wyzerowane
        }
	return false;
}

bool FuzzyLogic(double Test, double Threshold, double Probability)
{
    if ((Test > Threshold) && (!DebugModeFlag))
        return
            (Random() < Probability * Threshold * 1.0 / Test) /*im wiekszy Test tym wieksza szansa*/;
    else
        return false;
}

bool FuzzyLogicAI(double Test, double Threshold, double Probability)
{
    if ((Test > Threshold))
        return
            (Random() < Probability * Threshold * 1.0 / Test) /*im wiekszy Test tym wieksza szansa*/;
    else
        return false;
}

std::string ReadWord(std::ifstream& infile)
{
    std::string s = "";
    char c;
	bool nextword = false;

    while ((!infile.eof()) && (!nextword))
    {
        infile.get(c);
        if (_spacesigns.find(c) != string::npos)
            if (s != "")
                nextword = true;
        if (_spacesigns.find(c) == string::npos)
            s += c;
    }
    return s;
}

std::string Cut_Space(std::string s, int Just)
{
    int ii;

    switch (Just)
    {
    case CutLeft:
    {
        ii = 0;
        while ((ii < s.length()) && (s[ii + 1] == _SPACE))
            ++ii;
        s = s.substr(ii + 1, s.length() - ii);
    }
    case CutRight:
    {
        ii = s.length();
        while ((ii > 0) && (s[ii] == _SPACE))
            --ii;
        s = s.substr(0, ii);
    }
    case CutBoth:
    {
        s = Cut_Space(s, CutLeft);
        s = Cut_Space(s, CutRight);
    }
    }
    return s;
}
/*Cut_Space*/

std::string ExtractKeyWord(std::string InS, std::string KeyWord)
{
    std::string s;
    InS = InS + " ";
    std::size_t kwp = InS.find(KeyWord);
    if (kwp != string::npos)
    {
		s = InS.substr(kwp, InS.length());
        //s = Copy(InS, kwp, length(InS));
		s = s.substr(0, s.find_first_of(" "));
        //s = Copy(s, 1, Pos(" ", s) - 1);
    }
    else
        s = "";
    return s;
}

std::string DUE(std::string s) /*Delete Until Equal sign*/
{
    //DUE = Copy(s, Pos("=", s) + 1, length(s));
	return s.substr(s.find("=") + 1, s.length());
}

std::string DWE(std::string s) /*Delete While Equal sign*/
{
    size_t ep = s.find("=");
	if (ep != string::npos)
		//DWE = Copy(s, 1, ep - 1);
		return s.substr(0, ep);
    else
        return s;
}

std::string Ld2Sp(std::string s) /*Low dash to Space sign*/
{
    //std::string s2 = "";
	char tmp[] = { (char)"_", (char)" " };
	for (int b = 0; b < s.length(); ++b)
		if (s[b] == tmp[0])
			s[b] = tmp[1];
	//{
	//	if (s[b] == tmp[0])
	//		s2 = s2 + " ";
	//	else
	//		s2 = s2 + s[b];
	//}
 //   return s2;
}

std::string Tab2Sp(std::string s) /*Tab to Space sign*/
{
	//std::string s2 = "";
	char tmp[] = { (char)9, (char)" " };
	for (int b = 0; b < s.length(); ++b)
	{
		if (s[b] == tmp[0])
			s[b] = tmp[0];
	}
	return s;
	//{
	//	if (s[b] == tmp[0])
	//		s2 = s2 + " ";
	//	else
	//		s2 = s2 + s[b];
	//}
	//return s2;
}

void ComputeArc(double X0, double Y0, double Xn, double Yn, double R, double L, double dL,
                double &phi, double &Xout, double &Yout)
/*wylicza polozenie Xout Yout i orientacje phi punktu na elemencie dL luku*/
{
    double dX;
    double dY;
    double Xc;
    double Yc;
    double gamma;
    double alfa;
    double AbsR;

    if ((R != 0) && (L != 0))
    {
        AbsR = abs(R);
        dX = Xn - X0;
        dY = Yn - Y0;
        if (dX != 0)
            gamma = atan(dY * 1.0 / dX);
        else if (dY > 0)
            gamma = pi * 1.0 / 2;
        else
            gamma = 3 * pi * 1.0 / 2;
        alfa = L * 1.0 / R;
        phi = gamma - (alfa + pi * Round(R * 1.0 / AbsR)) * 1.0 / 2;
        Xc = X0 - AbsR * cos(phi);
        Yc = Y0 - AbsR * sin(phi);
        phi = phi + alfa * dL * 1.0 / L;
        Xout = AbsR * cos(phi) + Xc;
        Yout = AbsR * sin(phi) + Yc;
    }
}

void ComputeALine(double X0, double Y0, double Xn, double Yn, double L, double R, double &Xout,
                  double &Yout)
{
    double dX;
    double dY;
    double gamma;
    double alfa;
    /*   pX,pY : real;*/

    alfa = 0; // ABu: bo nie bylo zainicjowane
    dX = Xn - X0;
    dY = Yn - Y0;
    if (dX != 0)
        gamma = atan(dY * 1.0 / dX);
    else if (dY > 0)
        gamma = pi * 1.0 / 2;
    else
        gamma = 3 * pi * 1.0 / 2;
    if (R != 0)
        alfa = L * 1.0 / R;
    Xout = X0 + L * cos(alfa * 1.0 / 2 - gamma);
    Yout = Y0 + L * sin(alfa * 1.0 / 2 - gamma);
}

/*graficzne:*/

double Xhor(double h)
{
    return h * Hstep + Xmin;
}

double Yver(double v)
{
    return (Vsize - v) * Vstep + Ymin;
}

long Horiz(double x)
{
    x = (x - Xmin) * 1.0 / Hstep;
    if (x > -INT_MAX)
        if (x < INT_MAX)
            return Round(x);
        else
            return INT_MAX;
    else
        return -INT_MAX;
}

long Vert(double Y)
{
    Y = (Y - Ymin) * 1.0 / Vstep;
    if (Y > -INT_MAX)
        if (Y < INT_MAX)
            return Vsize - Round(Y);
        else
            return INT_MAX;
    else
        return -INT_MAX;
}

void ClearPendingExceptions()
// resetuje błędy FPU, wymagane dla Trunc()
{
    ; /*?*/ /* ASM
       FNCLEX
 ASM END */
}

// END