static bool AllowToMulMinusePluseActionFx(AddToTree.Tree Dummy)
{
if (Dummy == null)
{
return(true);
}
bool Is = true;
if (Dummy.SampleAccess == "/")
{
if (IS.IsMinuseOrPluse(Dummy.SampleAccess))
{
AddToTreeTreeLinkList FACTOR = FindSubFactor.FindSubFactorFx(Dummy.LeftSideAccess, Dummy.RightSideAccess);
if (!(FACTOR.ISEmpty()))
{
AddToTree.Tree FACT = new AddToTree.Tree(null, false);
do
{
FACT = FACTOR.DELETEFromTreeFirstNode();
if (IS.IsMinuseOrPluse(FACT.SampleAccess))
{
Is = false;
}
}while(!(FACTOR.ISEmpty()));
}
}
}
Is = Is && (AllowToMulMinusePluse.AllowToMulMinusePluseActionFx(Dummy.LeftSideAccess));
Is = Is && (AllowToMulMinusePluse.AllowToMulMinusePluseActionFx(Dummy.RightSideAccess));
return(Is);
}
static public AddToTree.Tree SimplifierCommonSubFactorCalculatorFx(AddToTree.Tree Dummy, ref bool CONTINUE, ref UknownIntegralSolver UIS)
{
if ((Dummy == null) || (!(IS.IsDivInNode(Dummy))))
{
return(Dummy);
}
//ERRORCORECTION2189743 :the Second condition of above is added.
int INCREASE = 2147483647 / 9;
UIS.SetProgressValue(UIS.progressBar9, 0);
if (Dummy.SampleAccess == "/")
{
UIS.SetProgressValue(UIS.progressBar9, INCREASE + UIS.progressBar9.Value);
Dummy = Simplifier.SimplifierFxSimpler(Dummy, ref UIS);
UIS.SetProgressValue(UIS.progressBar9, INCREASE + UIS.progressBar9.Value);
Dummy.LeftSideAccess = FactorActivation.FactorActivationFx(Dummy.LeftSideAccess, ref UIS);
UIS.SetProgressValue(UIS.progressBar9, INCREASE + UIS.progressBar9.Value);
Dummy.RightSideAccess = FactorActivation.FactorActivationFx(Dummy.RightSideAccess, ref UIS);
UIS.SetProgressValue(UIS.progressBar9, INCREASE + UIS.progressBar9.Value);
/* try
* {
* Dummy.LeftSideAccess.ThreadAccess = Dummy;
* Dummy.RightSideAccess.ThreadAccess = Dummy;
* }
* catch (NullReferenceException t) { ExceptionClass.ExceptionClassMethod(t); }
*/
UIS.SetProgressValue(UIS.progressBar9, INCREASE + UIS.progressBar9.Value);
Dummy = Simplifier.SimplifierFxSimpler(Dummy, ref UIS);
UIS.SetProgressValue(UIS.progressBar9, INCREASE + UIS.progressBar9.Value);
Dummy = NumberDivMul.NumberDivMulFx(Dummy, ref UIS);
UIS.SetProgressValue(UIS.progressBar9, INCREASE + UIS.progressBar9.Value);
AddToTreeTreeLinkList COMMONFACTOR = FindSubFactor.FindSubFactorFx(Dummy.LeftSideAccess, Dummy.RightSideAccess);
bool ENDLEFT = false;
bool ENDRIGHT = false;
AddToTree.Tree COMMONSUBFACORT = new AddToTree.Tree(null, false);
UIS.SetProgressValue(UIS.progressBar9, INCREASE + UIS.progressBar9.Value);
while (!((COMMONFACTOR.ISEmpty())) && ((ENDLEFT && ENDRIGHT)))
{
CONTINUE = true;
COMMONSUBFACORT = COMMONFACTOR.DELETEFromTreeFirstNode();
if (!ENDLEFT)
{
Dummy.LeftSideAccess = SimplifierCommonSubFactor.SimplifierCommonSubFactorActionLeftSideFx(Dummy.LeftSideAccess, COMMONSUBFACORT, ref ENDLEFT, FindSubFactor.FACTORLISTEDSAccess());
}
if (!ENDRIGHT)
{
Dummy.RightSideAccess = SimplifierCommonSubFactor.SimplifierCommonSubFactorActionRightSideFx(Dummy.RightSideAccess, COMMONSUBFACORT, ref ENDRIGHT, FindSubFactor.NotExpectedAccess());
}
Dummy = Simplifier.SimplifierFxSimpler(Dummy, ref UIS);
}
UIS.SetProgressValue(UIS.progressBar9, 2147483647);
if (!((IS.IsDivInNode(Dummy.LeftSideAccess)) || (IS.IsDivInNode(Dummy.RightSideAccess))))
{
return(Dummy);
}
}
if (Dummy.LeftSideAccess != null)
{
Dummy.LeftSideAccess = SimplifierCommonSubFactor.SimplifierCommonSubFactorCalculatorFx(Dummy.LeftSideAccess, ref CONTINUE, ref UIS);
}
if (Dummy.RightSideAccess != null)
{
Dummy.RightSideAccess = SimplifierCommonSubFactor.SimplifierCommonSubFactorCalculatorFx(Dummy.RightSideAccess, ref CONTINUE, ref UIS);
}
return(Dummy);
}
