static public AddToTree.Tree DeleteingMinusPluseFx(AddToTree.Tree Dummy)
{
Dummy = DeleteingMinusPluseTree.ArrangmentToDeleteingMinusPluse(Dummy);
Dummy = DeleteingMinusPluseTree.RepeatedlyDeletedAction(Dummy);
while (Dummy.ThreadAccess != null)
{
Dummy = Dummy.ThreadAccess;
}
return(Dummy);
}
static AddToTree.Tree ArrangmentToDeleteingMinusPluse(AddToTree.Tree Dummy)
{
if (Dummy == null)
{
return(Dummy);
}
DeleteingMinusPluseTree.ArrangmentToDeleteingMinusPluse(Dummy.LeftSideAccess);
DeleteingMinusPluseTree.ArrangmentToDeleteingMinusPluse(Dummy.RightSideAccess);
if (Dummy.SampleAccess == "+")
{
if (IS.IsMinuseOrPluse(Dummy.LeftSideAccess.SampleAccess))
{
Dummy.SetLefTandRightCommonlySide(Dummy.RightSideAccess, Dummy.LeftSideAccess);
}
}
return(Dummy);
}
private AddToTree.Tree Solver()
{
UknownIntegralSolver UNKNOWN = this;
this.SetProgressValue(progressBar1, 0);
int INCREASE = 2147483647 / 10;
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
//ERRORCUASE1715 :ERRROR cause of ERROR317142.the copy operation is not valid.
//ERROR3175 :Error in data structure .
//ERRORCAUSE0981243 ;The cause ERROR3175 of is at here.Error on copy tree.refer to page 177.
if (Enterface.SenderAccess.AutoSenderAccess.NodeAccess.SampleAccess == null && Enterface.SenderAccess.AutoSenderAccess != null)
{
Enterface.SenderAccess.AutoSenderAccess.NodeAccess = new AddToTree.Tree(Enterface.SenderAccess.AutoSenderAccess.CurrentStirngAccess, false);
}
AddToTree.Tree Copy = Enterface.SenderAccess.AutoSenderAccess.NodeAccess.CopyNewTree(Enterface.SenderAccess.AutoSenderAccess.NodeAccess);
//Copy = TransmisionToDeleteingMinusPluse.TrasmisionToDeleteingMinusPluseFx(Copy);
//ERROR918243 :The error at splitation.refer to page 176.
//Copy = TransmisionToDeleteingMinusPluse.TrasmisionToDeleteingMinusPluseFx(Copy);
AddToTree.Tree CopyNode = null;
CopyNode = Copy.CopyNewTree(Copy);
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
Copy = DeleteingMinusPluseTree.DeleteingMinusPluseFx(Copy);
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
Copy = Spliter.SpliterFx(Copy, ref UNKNOWN);
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
Copy = Simplifier.ArrangmentForSpliter(Copy);
//ERROR30175541 :SIMPLIFIER HAS CUASED TO SOME ERRRO.refer to page 176.
//ERROR312317 & ERRROR317140 :Error in simplification.refer to page 182.
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
//Copy = Simplifier.SimplifierFx(Copy,ref UNKNOWN);
//ERROR30174213 :The Simplified is invalid here.refer to page 180.
//Copy = Derivasion.DerivasionOfFX(Copy);
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
Copy = Integral.IntegralOfFX(Copy, ref UNKNOWN);
/*int i = 0;
* while (true)new AddToTree.Tree(null, false);
* {
* //Copy = Integral.DervisionI(i, Copy);
* //ERROR981273987 :The error at derivation.refer to page 205.
* Copy = Derivasion.DerivasionOfFX(Copy);
* //ERROR3017181920 :refer to page 188.
*
* Copy=Simplifier.SimplifierFx(Copy);
* i++;
* }
*/
//LOCATION13174253. refer to page 208.
//ERROR3070405060 :The error is here.refer to page 220.
//int NUM1 = Integral.NumberOfElements(Copy);
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
int NUM1 = Integral.NumberOfElements(Copy);
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
Copy = Simplifier.SimplifierFx(Copy, ref UNKNOWN);
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
int NUM2 = Integral.NumberOfElements(Copy);
this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
//Copy = RoundTree.RoundTreeMethod(Copy,0);
Copy.ThreadAccess = null;
Thread t = new Thread(new ThreadStart(Verifing));
t.Start();
//ERRORCORECTION6646464654643211:The Verification Return Valid result:1394/4/9
if (EqualToObject.IsEqualWithOutThreadConsiderationCommonly(Simplifier.SimplifierFx(RoundTree.RoundTreeMethod(ChangeFunction.ChangeFunctionFx(Derivasion.DerivasionOfFX(Copy.CopyNewTree(Copy), ref UNKNOWN), ref UNKNOWN), RoundTree.MaxFractionalDesimal(CopyNode)), ref UNKNOWN), CopyNode))
{
t.Abort();
SetLableValue(label17, "Verifing finished.Integral Answer Calculated is :");
MessageBox.Show("Verify OK");
}
else
{
t.Abort();
SetLableValue(label17, "Verifing finished.Integral Answer Calculated is :");
MessageBox.Show("Verify Failed.");
}
return(Copy);
//this.SetProgressValue(progressBar1, this.progressBar1.Value + INCREASE);
}
static AddToTree.Tree RepeatedlyDeletedAction(AddToTree.Tree Dummy)
{
if (Dummy == null)
{
return(Dummy);
}
DeleteingMinusPluseTree.RepeatedlyDeletedAction(Dummy.LeftSideAccess);
DeleteingMinusPluseTree.RepeatedlyDeletedAction(Dummy.RightSideAccess);
AddToTree.Tree Current = Dummy;
AddToTree.Tree CurrentTow = Dummy.LeftSideAccess;
if (CurrentTow != null)
{
while (IS.IsMinuseOrPluse(Dummy.SampleAccess))
{
if (CurrentTow != null)
{
while (IS.IsMinuseOrPluse(CurrentTow.SampleAccess))
{
if (((Dummy.SampleAccess == "+") && (CurrentTow.SampleAccess == "-"))
||
((Dummy.SampleAccess == "-") && (CurrentTow.SampleAccess == "+")))
{
if (EqualToObject.IsEqualWithThreadConsiderationCommonly(Dummy.RightSideAccess, CurrentTow.RightSideAccess))
{
//Dummy = Dummy.FINDTreeWithThreadConsideration(Dummy,Dummy);
String A = Dummy.SampleAccess;
if (Dummy != null)
{
if (Dummy.ThreadAccess == null)
{
Dummy = Dummy.LeftSideAccess;
Dummy.ThreadAccess = null;
}
else
{
Dummy.ThreadAccess.LeftSideAccess = Dummy.LeftSideAccess;
Dummy.LeftSideAccess.ThreadAccess = Dummy.ThreadAccess;
}
}
if (A == "+")
{
while ((!EqualToObject.IsEqualWithThreadConsiderationCommonly(Dummy.RightSideAccess, CurrentTow.RightSideAccess)) && (Dummy.SampleAccess != "-"))
{
Dummy = Dummy.LeftSideAccess;
}
}
if (A == "-")
{
while ((!EqualToObject.IsEqualWithThreadConsiderationCommonly(Dummy.RightSideAccess, CurrentTow.RightSideAccess)) && (Dummy.SampleAccess != "+"))
{
Dummy = Dummy.LeftSideAccess;
}
}
//Dummy = Dummy.FINDTreeWithThreadConsideration(Dummy, CurrentTow);
if (Dummy.ThreadAccess == null)
{
Dummy = Dummy.LeftSideAccess;
Dummy.ThreadAccess = null;
}
else
{
Dummy.ThreadAccess.LeftSideAccess = Dummy.LeftSideAccess;
Dummy.LeftSideAccess.ThreadAccess = Dummy.ThreadAccess;
}
//if (Dummy.ThreadAccess != null)
//Dummy.ThreadAccess.LeftSideAccess = Dummy.LeftSideAccess;
//Dummy = AddToTree.Tree.DeleteTree(Dummy, CurrentTow);
CurrentTow = Dummy.LeftSideAccess;
}
}
CurrentTow = CurrentTow.LeftSideAccess;
}
}
Dummy = Dummy.LeftSideAccess;
CurrentTow = Dummy.LeftSideAccess;
}
}
//Dummy= Dummy;
while ((!EqualToObject.IsEqualWithThreadConsiderationCommonly(Dummy, Current)) && (Dummy.ThreadAccess != null))
{
Dummy = Dummy.ThreadAccess;
}
CurrentTow = Dummy.RightSideAccess;
if (CurrentTow != null)
{
while (IS.IsMinuseOrPluse(Dummy.SampleAccess))
{
if (CurrentTow != null)
{
while (IS.IsMinuseOrPluse(CurrentTow.SampleAccess))
{
if (((Dummy.SampleAccess == "+") && (CurrentTow.SampleAccess == "-"))
||
((Dummy.SampleAccess == "-") && (CurrentTow.SampleAccess == "+")))
{
if (EqualToObject.IsEqualWithThreadConsiderationCommonly(Dummy.LeftSideAccess, CurrentTow.LeftSideAccess))
{
//Dummy = Dummy.FINDTreeWithThreadConsideration(Dummy, Dummy);
String A = Dummy.SampleAccess;
if (Dummy.ThreadAccess == null)
{
Dummy = Dummy.RightSideAccess;
Dummy.ThreadAccess = null;
}
else
{
Dummy.ThreadAccess.RightSideAccess = Dummy.RightSideAccess;
Dummy.RightSideAccess.ThreadAccess = Dummy.ThreadAccess;
}
if (A == "+")
{
while ((!EqualToObject.IsEqualWithThreadConsiderationCommonly(Dummy.LeftSideAccess, CurrentTow.LeftSideAccess)) && (Dummy.SampleAccess != "-"))
{
Dummy = Dummy.RightSideAccess;
}
}
if (A == "-")
{
while ((!EqualToObject.IsEqualWithThreadConsiderationCommonly(Dummy.RightSideAccess, CurrentTow.RightSideAccess)) && (Dummy.SampleAccess != "+"))
{
Dummy = Dummy.RightSideAccess;
}
}
if (Dummy.ThreadAccess == null)
{
Dummy = Dummy.RightSideAccess;
Dummy.ThreadAccess = null;
}
else
{
Dummy.ThreadAccess.RightSideAccess = Dummy.RightSideAccess;
Dummy.RightSideAccess.ThreadAccess = Dummy.ThreadAccess;
}
}
}
CurrentTow = CurrentTow.RightSideAccess;
}
}
Dummy = Dummy.RightSideAccess;
CurrentTow = Dummy.RightSideAccess;
}
}
return(Dummy);
}
