static public AddToTreeTreeLinkList GetBigestCommonFactor(AddToTree.Tree Dummy, ref UknownIntegralSolver UIS) { AddToTreeTreeLinkList CommonFactors = new AddToTreeTreeLinkList(); AddToTreeTreeLinkList Holder = new AddToTreeTreeLinkList(); //ERRORCORECTION1284797 :refer to page 302. Holder = ONLYMULnODE.CopyLinkList(); AddToTree.Tree Current = new AddToTree.Tree(null, false); AddToTreeTreeLinkList MulatedMul = new AddToTreeTreeLinkList(); AddToTree.Tree Factors = null; while (!(Holder.ISEmpty())) { Current = Holder.DELETEFromTreeFirstNode(); //ERRORCORCTION827346 :Refer to page 302. //ERROR715540 :Refer to page 302. MULATEDELEMENTS = FactorActivation.GetMultedElements(Current, ref UIS); AddToTreeTreeLinkList DummyConsiderationCopy = new AddToTreeTreeLinkList(); DummyConsiderationCopy = ONLYMULnODE.CopyLinkList(); AddToTreeTreeLinkList DummyConsideration = new AddToTreeTreeLinkList(); DummyConsideration = ONLYMULnODE.CopyLinkList(); AddToTree.Tree EveryMulatedElementsConsideration = new AddToTree.Tree(null, false); while (!(MULATEDELEMENTS.ISEmpty())) { DummyConsideration = DummyConsiderationCopy.CopyLinkList(); EveryMulatedElementsConsideration = MULATEDELEMENTS.DELETEFromTreeFirstNode(); //bool IsFactor = false; float Num = 0; if (EveryMulatedElementsConsideration.SampleAccess != null) { if ((IS.IsMinusAndPluseFirstNode(Dummy)) && (IS.ExistElementOnAllMulatedNodes(EveryMulatedElementsConsideration, DummyConsideration, ref UIS)) && (IS.IsNotUpperPowerOfNodeInList(EveryMulatedElementsConsideration, AbledFactors.CopyLinkList(), ref Num)) && (!(AbledFactors.FINDTreeWithOutThreadConsideration(EveryMulatedElementsConsideration)))) { Factors = EveryMulatedElementsConsideration; AbledFactors.ADDToTree(Factors); } } } } return(AbledFactors); }