void NobracketString::divide(string Anumb,string Atype, string Bnumb, string Btype){ //need to handle different types calculation, basicly differen type just return as it is.
isReturnOneNumb = false;
if(Atype==Btype){ //if they are the same type;
if(Atype == "frac")
{
Fraction* fra = new Fraction(Anumb);
Fraction* frb = new Fraction(Bnumb);
fra->Division(*frb);
opAnswer = fra->getAnswer();
isReturnOneNumb = true; // here may need to delete the object.
}
else if(Atype == "int")
{
Integers* intnumbA = new Integers(Anumb);
Integers* intnumbB = new Integers(Bnumb);
intnumbA->Divide(*intnumbB);
opAnswer = intnumbA->getAnswer(); //!!!!!here type has to be a "frac"!!!!!
//// //delete[] intnumb;
// if(opAnswer.find("/")<100)
// isReturnOneNumb = false;
// else
isReturnOneNumb = true;
}
else if(Atype=="log")
{
Logs* lgA = new Logs(Anumb);
Logs* lgB = new Logs(Bnumb);
lgA->divide(*lgB);
opAnswer = lgA->getAnswer();
//delete[] lg;
if(opAnswer.find("/")<100){ //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = false;}
else
isReturnOneNumb = true;
}
else if(Atype=="root")
{
nthRoot* nthNumb = new nthRoot(Anumb);
nthRoot* B = new nthRoot(Bnumb);
nthNumb->divide(*B);
opAnswer = nthNumb->getAns();
if(opAnswer.find("/")<100) //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = false;
else
isReturnOneNumb = true;
}//it is handled in the calculating()
else if(Atype=="pi"){
// Pi* p = new Pi(Anumb);
// p->Divide(*p);
// opAnswer = p->getAnswer();
isReturnOneNumb = true;
}
else if(Atype=="e"){
Exponential* p = new Exponential(Anumb);
Exponential* b = new Exponential(Bnumb);
p->Divide(*b);
opAnswer = p->getAnswer();
isReturnOneNumb = true;
}else if(Atype=="exp"){
Exponent* power = new Exponent(Anumb);
Exponent* b = new Exponent(Bnumb);
power->divide(*b);
opAnswer = power->getAnswer();
if(opAnswer.find("-")<100) //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = false;
else
isReturnOneNumb = true;
}
}else{ //if not the same type
}
}
void NobracketString::Multip(string Anumb,string Atype, string Bnumb, string Btype){
isReturnOneNumb = false;
if(Atype==Btype){ //if they are the same type;
if(Atype == "frac")
{
Fraction* fra = new Fraction(Anumb);
Fraction* frb = new Fraction(Bnumb);
fra->Multiplication(*frb);
opAnswer = fra->getAnswer();
isReturnOneNumb = true; // here may need to delete the object.
}
else if(Atype == "int")
{
Integers* intnumbA = new Integers(Anumb);
Integers* intnumbB = new Integers(Bnumb);
intnumbA->Multiply(*intnumbB);
opAnswer = intnumbA->getAnswer();
//// //delete[] intnumb;
isReturnOneNumb = true;
}
else if(Atype=="log")
{
Logs* lgA = new Logs(Anumb);
Logs* lgB = new Logs(Bnumb);
lgA->Multip(*lgB);
opAnswer = lgA->getAnswer();
//delete[] lg;
if(opAnswer.find("*")<100) //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = false;
else
isReturnOneNumb = true;
}
else if(Atype=="root")
{
nthRoot* nthNumb = new nthRoot(Anumb);
nthRoot* B = new nthRoot(Bnumb);
nthNumb->multiply(*B);
opAnswer = nthNumb->getAns();
if(opAnswer.find("*")<100) //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = false;
else
isReturnOneNumb = true;
}//it is handled in the calculating()
else if(Atype=="pi"){
// Pi* p = new Pi(Anumb);
// p->Multiply(*p);
// opAnswer = p->getAnswer();
isReturnOneNumb = true;
}
else if(Atype=="e"){
Exponential* p = new Exponential(Anumb);
p->Multiply(*p);
opAnswer = p->getAnswer();
isReturnOneNumb = true;
}else if(Atype=="exp"){
Exponent* power = new Exponent(Anumb);
Exponent* b = new Exponent(Bnumb);
power->multiply(*b);
opAnswer = power->getAnswer();
if(opAnswer.find("-")<100) //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = false;
else
isReturnOneNumb = true;
}
}
else{
if((Atype=="frac"&&Btype=="int")||(Btype=="frac"&&Atype=="int")){ //if not the same type
Fraction* fra = new Fraction(Anumb);
Fraction* frb = new Fraction(Bnumb);
fra->Multiplication(*frb);
opAnswer = fra->getAnswer();
isReturnOneNumb = true;
}else if((Atype=="int"&&Btype=="root")||(Btype=="int"&&Atype=="root")){
nthRoot* nthNumb = new nthRoot(Anumb);
nthRoot* B = new nthRoot(Bnumb);
nthNumb->multiply(*B);
opAnswer = nthNumb->getAns();
// if(opAnswer.find("*")<100) //if the opanswer string contains "+", means it return a complex expression
// isReturnOneNumb = true;
// else
isReturnOneNumb = true;
}
else{
isReturnOneNumb=false;
}
}
}
void NobracketString::add(string Anumb, string Atype, string Bnumb, string Btype){ //does not need to handle differen type here only handel same type or (fraction and integer)
if(Atype==Btype){ //if they are the same type;
if(Atype == "frac")
{
Fraction* fra = new Fraction(Anumb);
Fraction* frb = new Fraction(Bnumb);
fra->Addition(*frb);
opAnswer = fra->getAnswer();
isReturnOneNumb = true;
//same type fraction should always return one numb
//delete[] fra; // here may need to delete the object.
}
else if(Atype == "int")
{
Integers* intnumbA = new Integers(Anumb);
Integers* intnumbB = new Integers(Bnumb);
intnumbA->Add(*intnumbB);
opAnswer = intnumbA->getAnswer();
//// //delete[] intnumb;
isReturnOneNumb = true;
}
else if(Atype=="log")
{
Logs* lgA = new Logs(Anumb);
Logs* lgB = new Logs(Bnumb);
lgA->add(*lgB);
opAnswer = lgA->getAnswer();
//delete[] lg;
if(opAnswer.find("+")<100) //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = false;
else
isReturnOneNumb = true;
}
else if(Atype=="root")
{
nthRoot* nthNumb = new nthRoot(Anumb);
nthRoot* B = new nthRoot(Bnumb);
nthNumb->add(*B);
opAnswer = nthNumb->getAns();
if(opAnswer.find("+")<100) //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = false;
else
isReturnOneNumb = true;
}//it is handled in the calculating()
else if(Atype=="pi"){
//
isReturnOneNumb = true;
}
else if(Atype=="e"){
Exponential* p = new Exponential(Anumb);
p->Add(*p);
opAnswer = p->getAnswer();
isReturnOneNumb = true;
}else if(Atype=="exp"){
}
}else{ //if not the same type
if((Atype=="root"&&Btype=="int")||(Btype=="int"&&Atype=="root")){
nthRoot* nthNumb = new nthRoot(Anumb);
nthRoot* B = new nthRoot(Bnumb);
nthNumb->add(*B);
opAnswer = nthNumb->getAns();
if(opAnswer.find("*")<100) //if the opanswer string contains "+", means it return a complex expression
isReturnOneNumb = true;
else
isReturnOneNumb = true;
}
}
}
