Ok dont answer this I finally made it myself..
here it is just in case someone is interested..
Code:
double power(double pow, double from) // x power y
{
double temp = from;
if(pow > 0)
{
--pow; // x power 1 means x 1 time not 2 times !
for(int i = 0; i < pow; i++) temp *= from; // temp = from x times
}
else if(pow < 0)
{
--pow; //10/10 = 1 so must add 1..
for(int i = 0; i > pow; --i) temp /= from; // temp = from divided x times
}
else if (pow == 0) temp = 1; // x power 0 == 1
return temp;
}
double into() //upgrade this!
{
const int ten = 10; // with this 2 will become 20!
double temp = 0, answer = 0;
int j = 0, z = 0;
unsigned int u = (temp_string.size()-1);
int y = n;
while((isdigit(temp_string[n]))&&(n<u)) ++n;
if(temp_string[n] == '.') z = 666;
if(!(isdigit(temp_string[n]))) --n;
for(int h = n; h>(y-1); --h, ++j)
{
temp = ((temp_string[h] - '0')*(power(j, ten)));
answer += temp;
}
if(z==666)
{
n +=2;
for(j=-1; isdigit(temp_string[n]); n++, j--)
{
temp = ((temp_string[n] - '0')*(power(j, ten)));
answer += temp;
}
}
--n;
return answer;
}