Complete this code and highlight where you coded
its C++
#include
#include
using namespace std;
class Rational
{
public:
Rational( int numerator, int denominator );
Rational( int numerator ); // sets denominator to 1
Rational(); // sets numerator to 0, denominator to 1
Rational operator + (const Rational& );
Rational operator - (const Rational& );
Rational operator * (const Rational& );
Rational operator / (const Rational& );
bool operator < (const Rational& );
bool operator <= (const Rational& );
bool operator > (const Rational& );
bool operator >= (const Rational& );
bool operator == (const Rational& );
friend ostream& operator << ( ostream&, const Rational& );
friend istream& operator >> ( istream&, Rational& );
private:
int n;
int d;
};
void normalize(int& n, int& d);
//test program for Rational class
int main()
{
cout << "Testing declarations" << endl;
cout << "Rational x, y(2), z(-5,-6), w(1,-3);" << endl;
Rational x, y(2), z(-5,-6), w(1,-3);
cout << "x = " << x << ", y = " << y << ", z = " << z
<< ", w = " << w << endl;
cout << "Testing >> overloading: \\Enter a fraction in the format "
<< "integer_numerator/integer_denominator" << endl;
cin >> x;
cout << "You entered the equivalent of: " << x << endl;
cout << z << " - (" << w << ") = " << z - w << endl;
cout << "Testing the constructor and normalization routines: " << endl;
y = Rational(-128, -48);
cout << "y =Rational(-128, -48) outputs as " << y << endl;
y = Rational(-128, 48);
cout << "y =Rational(-128, 48 ) outputs as " << y << endl;
y = Rational(128,-48);
cout << "y = Rational(128, -48) outputs as " << y << endl;
Rational a(1,1);
cout << "Rational a(1,1); a outputs as: " << a << endl;
Rational ww = y*a;
cout << y << " * " << a << " = " << ww << endl;
w = Rational(25,9);
z = Rational(3,5);
cout << "Testing arithmetic and relational operator overloading"
<< endl;
cout << w << " * " << z << " = " << w * z << endl;
cout << w << " + " << z << " = " << w + z << endl;
cout << w << " - " << z << " = " << w - z << endl;
cout << w << " / " << z << " = " << w / z << endl;
cout << w << " < " << z << " = " << (w < z) << endl;
cout << w << " < " << w << " = " << (w < w) << endl;
cout << w << " <= " << z << " = " << (w <= z) << endl;
cout << w << " <= " << w << " = " << (w <= w) << endl;
cout << w << " > " << z << " = " << (w > z) << endl;
cout << w << " > " << w << " = " << (w > w) << endl;
cout << w << " >= " << z << " = " << (w >= z) << endl;
cout << w << " >= " << w << " = " << (w >= w) << endl;
w = Rational(-21,9);
z = Rational(3,5);
cout << w << " * " << z << " = " << w * z << endl;
cout << w << " + " << z << " = " << w + z << endl;
cout << w << " - " << z << " = " << w - z << endl;
cout << w << " / " << z << " = " << w / z << endl;
cout << w << " < " << z << " = " << (w < z) << endl;
cout << w << " < " << w << " = " << (w < w) << endl;
cout << w << " <= " << z << " = " << (w <= z) << endl;
cout << w << " <= " << w << " = " << (w <= w) << endl;
cout << w << " > " << z << " = " << (w > z) << endl;
cout << w << " > " << w << " = " << (w > w) << endl;
cout << w << " >= " << z << " = " << (w >= z) << endl;
cout << w << " >= " << w << " = " << (w >= w) << endl;
return 0;
}
Rational::Rational( int numer, int denom )
{
normalize(numer, denom);
n = numer;
d = denom;
}
//sets denominator to 1
Rational::Rational( int numer ): n(numer), d(1) // See Text, Appendix 7
{
//body deliberately empty
}
// sets numerator to 0, denominator to 1
Rational::Rational():n(0), d(1) // see Appendix 7 of text
{
//body deliberately empty
}
//LIU: write the definitions of the operators
//postcondition: return value is gcd of the absolute values of m and n
//depends on function int abs(int); declared in cstdlib
int gcd ( int m, int n)
{
int t;
m = abs (m); // don't care about signs.
n = abs (n);
if ( n > m ) // always store larger number in m, smaller number in n so algorithm will work!
{
t = m;
m = n;
n = t;
}
int r;
r = m % n;
while ( r != 0 )
{
r = m%n;
m = n;
n = r;
}
return m;
}
//postcondition: n and d (to be numerator and denominator of a fraction)
//have all common factors removed, and d > 0.
void normalize( int& n, int& d)
{
// remove common factors:
int g = gcd(n, d);
n = n/g;
d = d/g;
//fix things so that if the fraction is 'negative'
//it is n that carries the sign. If both n and d are
//negative, each is made positive.
if ( n > 0 && d < 0 || n < 0 && d < 0 )
{
n = -n;
d = -d;
}
// assert: d > 0
}