Rational/Rational.cpp

#include "Rational.h"
#include <iostream>
#include <iomanip>
#include <bitset>
#include <math.h>

using namespace std;

Rational::Rational(){
    num = 0;
    denum = 1;

}

Rational::Rational(int num1, int num2)
{
    num = num1;
    denum = num2;
    simple();
}

Rational::Rational(float x)
{
    const uint32_t bits = *(uint32_t*)(&x);

    const uint32_t signBit = bits >> 31;
    const uint32_t exponentBits = (bits >> 23) & 0xff; 
    const uint32_t mantisBits = bits & 0x7fffff; 
    uint32_t significand = (1u << 23u) | mantisBits;

    const int64_t sign = signBit ? -1 : 1;

    const int32_t exp = exponentBits - 127 - 23;
    static uint32_t smth = 1 << (uint32_t)(-exp);

    cout << sign * (int64_t)(significand) << '/' << smth;
    num = sign * (int64_t)(significand);
    denum = smth;
    simple();
}

Rational::Rational(double x)
{
    const unsigned long long int bits = *(unsigned long long int*)(&x);
    const unsigned long long int signBit = (bits >> 63) & 1;
    const unsigned long long int exponentBits = (bits >> 52) & 0x7ff;
    const unsigned long long int mantisBits = bits & 0xFFFFFFFFFFFFF;
    unsigned long long int significant = (long long int)pow(2, 52) | mantisBits;

    const long long int sign = signBit ? -1 : 1;

    const long long int exp = exponentBits - 1023 - 52;

    cout << bitset<64>(bits) << endl;
    cout << bitset<64>(signBit) << endl;
    cout << bitset<64>(exponentBits) << endl;
    cout << bitset<64>(mantisBits) << endl;
    cout << bitset<64>(pow(2,52)) << endl;
    cout << bitset<64>(significant) << endl;
    cout << bitset<64>(exp) << endl;

    cout << setprecision(15) << fixed << sign * significant << '/' << (unsigned long long int)pow(2, -exp) << endl; 
    cout << (sign * significant) / pow(2, -exp) << endl;
    cout << sign * pow(2, -1022) * significant << endl;
}

Rational& Rational::operator += (const Rational& r)
{
    int scm = lcm(denum, r.denum);
    num = (num * (scm/denum) + r.num * (scm/r.denum));
    denum = scm;
    return *this;
}

Rational Rational :: operator + (const Rational& r) const
{
    Rational res(*this);
    return res += r;
}

Rational& Rational::operator -= (const Rational& r)
{
    int scm = lcm(denum, r.denum);
    num = (num * (scm/denum) - r.num * (scm/r.denum));
    denum = scm;
    return *this;
}

Rational Rational :: operator - (const Rational& r) const
{
    Rational res(*this);
    return res -= r;
}

Rational& Rational::operator *= (const Rational& r)
{
    num *= r.num;
    denum *= r.denum;
    simple();
    return *this;
}

Rational Rational :: operator * (const Rational& r) const
{
    Rational res(*this);
    return res *= r;
}

Rational& Rational::operator /= (const Rational& r)
{
    num *= r.denum;
    denum *= r.num;
    simple();
    return *this;
}

Rational Rational :: operator / (const Rational& r) const
{
    Rational res(*this);
    return res /= r;
}

ostream& operator <<(ostream& out, const Rational& r)
{
    return out << '(' << r.num << ")/(" << r.denum << ')';
}

Rational::operator double() const
{
    return ((double)num/(double)denum);
}

Rational::operator int() const
{
    return int(double(*this));
}

int Rational::lcm(long long int num1, long long int num2)
{
    int result = 1;
    for(int dnum = 2; num1 > 1 or num2 > 1; dnum++)
    {
        if(num1%dnum==0 or num2%dnum==0)
        {
            num1%dnum==0 ? num1/=dnum : num1*1;
            num2%dnum==0 ? num2/=dnum : num1*1;
            result *= dnum;
            dnum--;
        }
    }
    return result;
}

int Rational::gcd(long long int num1, long long int num2)
{
    while (num1 && num2)
        if (num1 >= num2)
           num1 %= num2;
        else
           num2 %= num1;
    return num1 | num2;
}

void Rational::simple()
{
    int gct = gcd(num, denum);
    num /= gct;
    denum /= gct; 
}