重载左移操作符,也就是插入器

因为上节那个重载操作符课后练习的代码里面要多次调用print方法才能实现分数打印,所以改进一下

这里通过重载<<操作符来实现print打印分数的功能(<<官方叫插入器)

 

下面是一个operator<<()函数的原型:

- std::ostream& operator<<(std::ostream& os, Rational f);

第一个输入参数os是将要向它写数据的那个流,它是以“引用传递”方式传递的。

第二输入参数时打算写到那个流里的数据值,不同的operator<<()重载函数就是因为这个输入参数才相互区别的。

返回类型是ostream流的引用,一般来说,在调用operator<<()重载函数时传递给它的是哪一个流,它返回的就应该是那个流的一个引用。

下面例子

#include <iostream>
#include <string>
#include <stdlib.h>

class Rational
{
public:
	Rational(int num, int denom);  //num表示分子,denom表示分母

	Rational operator+(Rational rhs); //rhs = right hand side表示重载右边的参数
	Rational operator-(Rational rhs);
	Rational operator*(Rational rhs);
	Rational operator/(Rational rhs);

	void print();

private:
	void normalize(); //负责对分数的简化处理

	int numerator;    //分子
	int denominator;  //分母

	friend std::ostream& operator<<(std::ostream& os, Rational f);
};

Rational::Rational(int num, int denom)
{
	numerator = num;
	denominator = denom;

	normalize();
}

//normalize()对分数进行简化操作包括:
//1. 只允许分子为负数,如果分母为负数则把负数挪到分子部分,如1/-2 == -1/2
//2. 利用欧几里得算法(辗转求余原理)将分数进行简化,如2/10 => 1/5
void Rational::normalize()
{
	//确保分母为正
	if (denominator < 0)
	{
		numerator = -numerator;
		denominator = -denominator;
	}

	//欧几里得算法
	int a = abs(numerator);
	int b = abs(denominator);

	//求出最大公约数
	while (b > 0)
	{
		int t = a % b;
		a = b;
		b = t;
	}

	//分子、分母分别除以最大公约数得到最简化分数
	numerator /= a;
	denominator /= a;
}

Rational Rational::operator+(Rational rhs)
{
	int a = numerator;
	int b = denominator;
	int c = rhs.numerator;
	int d = rhs.denominator;

	int e = a * d + b * c;
	int f = b * d;

	return Rational(e, f);
}

Rational Rational::operator-(Rational rhs)
{
	rhs.numerator = -rhs.numerator;
	return operator+(rhs);
}

Rational Rational::operator*(Rational rhs)
{
	int a = numerator;
	int b = denominator;
	int c = rhs.numerator;
	int d = rhs.denominator;

	int e = numerator * rhs.numerator;
	int f = denominator * rhs.denominator;

	return Rational(e, f);
}

Rational Rational::operator/(Rational rhs)
{
	int t = rhs.numerator;
	rhs.numerator = rhs.denominator;
	rhs.denominator = t;

	return operator*(rhs);
}

void Rational::print()
{
	if (numerator % denominator == 0)
	{
		std::cout << numerator / denominator;
	}
	else
	{
		std::cout << numerator << "/" << denominator;
	}
}

std::ostream& operator<<(std::ostream& os, Rational f);

int main()
{
	Rational f1(2, 16);
	Rational f2(7, 8);

	//测试有理数加法运算
	std::cout << f1 << " + " << f2 << " = " << (f1 + f2) << std::endl;

	//测试有理数减法运算
	std::cout << f1 << " - " << f2 << " = " << (f1 - f2) << std::endl;

	//测试有理数乘法运算
	std::cout << f1 << " * " << f2 << " = " << (f1 * f2) << std::endl;

	//测试有理数除法运算
	std::cout << f1 << " / " << f2 << " = " << (f1 / f2) << std::endl;

	return 0;
}

std::ostream& operator<<(std::ostream& os, Rational f)
{
	os << f.numerator << "/" << f.denominator;
	return os;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值