club.h

足球俱乐部游戏的管理软件 能够完成交易等

#ifndef _club_h_
#define _club_h_

#include <string>
#include <iostream>
#include <algorithm>
 
using namespace std;
class club
{
	string club_name;     // 俱乐部名称
	string club_nation;    //所属国家
	int club_balance;    //  结余
    double club_financepolicy;   //财政积极度 percent
  
    int buygame;         //买球员策略
	int sellgame;      //卖球员策略



public:
    bool content;
    club():content(0){}
    bool club_search(string formula);      //搜索俱乐部
 	void buyplayer();    //买球员
    void club_search(string &str){}
    void save();   //保存数据
  
// 设定球队参数	
	void set_name(string &st)
	{club_name=st;}
	void set_nation(string &st)
	{club_nation=st;}
	void set_balance(int m)
	{club_balance=m;}
	void set_financepolicy(double dl)
	{club_financepolicy=dl;}
	void set_buy(int m)
	{ buygame=m; }
	void set_sell( int m)
	{ sellgame=m; }
    
	int getbuygame()
	{
		return buygame;
	}
	int getsellgame()
	{
		return sellgame;
	}
	int getbalance()
	{
		return club_balance;
	}
	double getpolicy()
	{
		return club_financepolicy;
	}
	string getname()
	{
		return club_name;
	}
    string getnation()
	{
		return club_nation;
	}

// 输出
    
    void show()
	{
		cout<<club_name<<endl;
	}
    bool transfer(string formula);
    bool club::club_check(int item,double least,double most,string name);

	friend bool compute(string formula);
};

bool club::club_check(int item,double least,double most,string name)
{	
	switch(item)
	{
	case 1: return(club_name==name);break;
	case 2: return(club_nation==name);break;	
	case 3: return((club_balance>=least)&&(club_balance<=most));break;
	case 4: return((club_financepolicy>=least)&&(club_financepolicy<=most));break;
	case 5: return((buygame>=least)&&(buygame<=most));break;
	case 6: return((sellgame>=least)&&(sellgame<=most));break;
	}
}

bool club::transfer(string formula)
{
	string str,name;
	int i=1,num;
	double least=-1.0,most=4000000000.0;
	if(formula.find("Name")<formula.size())
	{
		num=1;
		name=formula.substr(6,formula.size()-7);
	}
	else if(formula.find("Nation")<formula.size())
	{
		num=2;
		name=formula.substr(8,formula.size()-9);
	}
	else if(formula.find("Balance")<formula.size())num=3;
	else if(formula.find("Finance Policy")<formula.size())num=4;	
	else if(formula.find("Sell Policy")<formula.size())num=5;
	else if(formula.find("Buy Policy")<formula.size())num=6;		
	if(num>2)
	{
		if(count(formula.begin(),formula.end(),'<')==2)
		{
			if(formula.find('<')==formula.find("<="))
				least=atof(formula.substr(1,formula.find('<')-1).c_str());
			else
				least=atof(formula.substr(1,formula.find('<')-1).c_str())+1;
			formula=formula.erase(1,formula.find('<')-1);
		}
		if(count(formula.begin(),formula.end(),"<=")==1)
			most=atof(formula.substr(formula.find("<=")+2,formula.size()-formula.find("<=")-3).c_str());
		else if(count(formula.begin(),formula.end(),'<')==1)
			most=atof(formula.substr(formula.find('<')+1,formula.size()-formula.find('<')-2).c_str())-1;
		else if(count(formula.begin(),formula.end(),">=")==1)
			least=atof(formula.substr(formula.find(">=")+2,formula.size()-formula.find(">=")-3).c_str());
		else if(count(formula.begin(),formula.end(),'>')==1)
			least=atof(formula.substr(formula.find('>')+1,formula.size()-formula.find('>')-2).c_str())+1;
		else
		{
			most=atof(formula.substr(formula.find('=')+1,formula.size()-formula.find('=')-2).c_str());
			least=most;
		}
	}
	return(club_check(num,least,most,name));
}

bool club::club_search(string formula)  //俱乐部查询
{
	int i=0;
	string formula1;
	while(i<formula.size())
	{
		string str;
		if(formula[i]=='(')
		{
			int j=0;
			do
			{
				string aa = "";
				aa = aa + formula[i];

				str.insert(j,aa);
				i++;
				j++;
			}
			while((formula[i]=='(')||(formula[i]==')')||(i>=formula.size()));
			if(formula[i]=='(')
				formula1.insert(formula1.size(),str);
			else if(formula[i]==')')
			{
				string aa="";
				aa=aa+formula[i];
				str.insert(j,aa);
				aa="";
				aa=aa+char(transfer(str)+48);
				formula1.insert(formula1.size(),aa);
				i++;
			}
		}
		else
		{
			string aa="";
			aa=aa+formula[i];
			formula1.insert(formula1.size(),aa);
			i++;
		}
	}
	return(compute(formula1));
}

#endif