/*
*Copyright (c) 2014,烟台大学计算机学院
*All rights reserved.
*文件名称:Annpion.cpp
*作者:王耀鹏
*完成日期:2015年4月15日
*版本号:v1.0
*
*问题描述:阅读教材例10.1。该例实现了一个复数类,但是美中不足的是,复数类的实部和虚部都固定只能是double型的。可以通过模板类的技术手段,设计Complex,使实部和虚部的类型为定义对象时指定的实际类型。
*输入描述:无。
*输出描述:复数的加减乘除。
*/
#include<iostream>
using namespace std;
template <class T>
class Complex
{
public:
Complex(){real=0;imag=0;}
Complex(T r,T i){real=r;imag=i;}
Complex complex_add(Complex &c2);
Complex complex_minus(Complex &c2);
Complex complex_multiply(Complex &c2);
Complex complex_divide(Complex &c2);
void display();
template<class T1>friend Complex<T1> add_complex(const Complex<T1> &c1,const Complex<T1> &c2);
private:
T real;
T imag;
};
template <class T>
Complex<T> Complex<T>::complex_add(Complex<T> &c2)
{
Complex<T> c;
c.real=real+c2.real;
c.imag=imag+c2.imag;
return c;
}
template <class T>
Complex<T> Complex<T>::complex_minus(Complex &c2)
{
Complex<T> c;
c.real=real-c2.real;
c.imag=imag-c2.imag;
return c;
}
template <class T>
Complex<T> Complex<T>::complex_multiply(Complex &c2)
{
Complex <T> c;
c.real=real*c2.real-imag*c2.imag;
c.imag=imag*c2.real+real*c2.imag;
return c;
}
template <class T>
Complex<T> Complex<T>::complex_divide(Complex &c2)
{
Complex <T> c;
T d=c2.real*c2.real+c2.imag*c2.imag;
c.real=(real*c2.real+imag*c2.imag)/d; //此处有危险未排除:除法溢出
c.imag=(imag*c2.real-real*c2.imag)/d;
return c;
}
template <class T>
void Complex<T>::display()
{
cout<<"("<<real<<","<<imag<<"i)"<<endl;
}
template <class T>
Complex<T> add_complex(const Complex<T> &c1,const Complex<T> &c2)
{
Complex<T> c;
c.real=c1.real+c2.real;
c.imag=c1.imag+c2.imag;
return c;
}
int main( )
{
Complex<int> c1(3,4),c2(5,-10),c3;
c3=c1.complex_add(c2); //调用成员函数支持加法运算,有一个形参
cout<<"c1+c2=";
c3.display( );
Complex<double> c4(3.1,4.4),c5(5.34,-10.21),c6;
c6=c4.complex_add(c5); //调用成员函数支持加法运算,有一个形参
cout<<"c4+c5=";
c6.display( );
Complex<int> c7;
c7=add_complex(c1,c2); //调用友员函数支持加法运算,有两个形参
cout<<"c1+c2=";
c7.display( );
Complex<double> c8;
c8=add_complex(c4,c5); //调用友员函数支持加法运算,有两个形参
cout<<"c4+c5=";
c8.display( );
return 0;
}
运行结果: