应用 设计模式的理念 来设计一款计算器

程序代码如下:

#include <iostream>
using namespace std;

//运算类
class Coperation{

public:
	Coperation()
	{
		cout<<"Coperation constriction"<<endl;
	}

	virtual ~Coperation()
	{
		cout<<"Coperation destriction"<<endl;
	}

	double Get_numberA();
	void Set_numberA(double n);
	double Get_numberB();
	void Set_numberB(double n);

	virtual double Get_Result()
	{
		double result = 0;
		return result;
	}
private:
	double m_numberA;
	double m_numberB;
};

double Coperation::Get_numberA()
{
	return m_numberA;
}

void Coperation::Set_numberA(double n)
{
	m_numberA = n;
}

double Coperation::Get_numberB()
{
	return m_numberB;
}

void Coperation::Set_numberB(double n)
{
	m_numberB = n;
}


//加法类
class COperation_Add:public Coperation{
	
public:
	COperation_Add()
	{
		cout<<"COperation_Add constriction"<<endl;
	}
	~COperation_Add()
	{
		cout<<"COperation_Add destriction"<<endl;
	}
	double Get_Result();
};
double  COperation_Add::Get_Result()
{
	double result = 0;
	result = Get_numberA() + Get_numberB();
	return result;
}


//减法类
class COperation_Sub:public Coperation{
	
public:
	COperation_Sub()
	{
		cout<<"COperation_Sub constriction"<<endl;
	}
	~COperation_Sub()
	{
		cout<<"COperation_Sub dsetriction"<<endl;
	}
	double Get_Result();
};
double  COperation_Sub::Get_Result()
{
	double result = 0;
	result = Get_numberA() - Get_numberB();
	return result;
}


//乘法类
class COperation_Multi:public Coperation{
	
public:
	COperation_Multi()
	{
		cout<<"COperation_Multi constriction"<<endl;
	}
	~COperation_Multi()
	{
		cout<<"COperation_Multi destriction"<<endl;
	}
	double Get_Result();
};
double  COperation_Multi::Get_Result()
{
	double result = 0;
	result = Get_numberA() * Get_numberB();
	return result;
}


//除法类
class COperation_Div:public Coperation{
	
public:
	COperation_Div()
	{
		cout<<"COperation_Div constriction"<<endl;
	};
	~COperation_Div()
	{
		cout<<"COperation_Div destriction"<<endl;
	}
	double Get_Result();
};
double  COperation_Div::Get_Result()
{
	try
	{
		double result = 0;
		if(Get_numberB() == 0)
			throw "invalid argument(s)";
		result = Get_numberA() / Get_numberB();
		return result;
	}
	catch(double n)
	{
		cout<<"B is:"<<n<<endl;
	}
}



//运算工厂类
class COperationFactory{

public:
	COperationFactory();
	~COperationFactory();

	Coperation *Get_piont_oper();
	void CreateOperate(char operate)
	{
		
		switch(operate)
		{
		case '+':
			oper = new COperation_Add();
			break;
		case '-':
			oper = new COperation_Sub();
			break;
		case '*':
			oper = new COperation_Multi();
			break;
		case '/':
			oper = new COperation_Div();
			break;
		}
	}
public:
	Coperation *oper;

};
COperationFactory::COperationFactory()
{
	oper = NULL;
	cout<<"COperationFactory constriction"<<endl;
}
COperationFactory::~COperationFactory()
{
	delete oper;
	cout<<"COperationFactory destriction"<<endl;
}
Coperation *COperationFactory::Get_piont_oper()
{
	return oper;
}



int main(void)
{	
	Coperation *oper;
	COperationFactory op_factory;
	char c = '+';
	op_factory.CreateOperate(c);

	op_factory.Get_piont_oper()->Set_numberA(1);
	op_factory.Get_piont_oper()->Set_numberB(2);
	
	double add_result = op_factory.Get_piont_oper()->Get_Result();
	cout << op_factory.Get_piont_oper()->Get_numberA()<<" + "<<op_factory.Get_piont_oper()->Get_numberB()<< " = "<<add_result<<endl;

	return 0;
	
}

 

运行结果


 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值