public override Node GetDerivative() //O = original, D = derivative
{
Node node1O1 = node1.Clone();
Node node1D = node1.GetDerivative();
Node node2O1 = node2.Clone();
Node nodeTimes1 = new NodeTimes();
Node nodeTimes2 = new NodeTimes();
if (node2.ContainsX())
{
Node thisNode = this.Clone();
Node node1O2 = node1.Clone();
Node node2D = node2.GetDerivative();
Node nodePlus = new NodePlus();
Node nodeLN = new NodeLN();
Node nodeDiv = new NodeDivision();
Node nodeTimes3 = new NodeTimes();
nodeTimes3.AddNode1(thisNode);
nodeTimes3.AddNode2(nodePlus);
nodePlus.AddNode1(nodeTimes1);
nodePlus.AddNode2(nodeTimes2);
nodeTimes1.AddNode1(node1D);
nodeTimes1.AddNode2(nodeDiv);
nodeDiv.AddNode1(node2O1);
nodeDiv.AddNode2(node1O1);
nodeTimes2.AddNode1(node2D);
nodeTimes2.AddNode2(nodeLN);
nodeLN.AddNode1(node1O2);
return(nodeTimes3);
}
else
{
Node node2O2 = node2.Clone();
Node nodeNumberOne = new NodeNumber(false, false, 1);
Node nodeMin = new NodeMinus();
Node nodePow = new NodePower();
nodeTimes2.AddNode1(nodePow);
nodeTimes2.AddNode2(nodeTimes1);
nodeTimes1.AddNode1(node2O1);
nodeTimes1.AddNode2(node1D);
nodePow.AddNode1(node1O1);
nodePow.AddNode2(nodeMin);
nodeMin.AddNode1(node2O2);
nodeMin.AddNode2(nodeNumberOne);
return(nodeTimes2);
}
}
public override Node Clone()
{
Node newNode = new NodeLN();
Node newNode1 = node1.Clone();
newNode.AddNode1(newNode1);
return(newNode);
}
private Node combineNodes(Node cleanNode1, Node cleanNode2)
{
if (cleanNode1 is NodeNumber && !(cleanNode2 is NodeNumber))
{
if (((NodeNumber)cleanNode1).Number == 0)
{
return(cleanNode2);
}
}
if (cleanNode2 is NodeNumber && !(cleanNode1 is NodeNumber))
{
if (((NodeNumber)cleanNode2).Number == 0)
{
return(cleanNode1);
}
}
if (cleanNode1 is NodeNumber && cleanNode2 is NodeNumber)
{
if (((NodeNumber)cleanNode1).Number == 0)
{
Node newNumberNode;
newNumberNode = new NodeNumber(cleanNode2.ContainsX(), cleanNode2.ContainsP(), ((NodeNumber)cleanNode2).Number);
return(newNumberNode);
}
else if (((NodeNumber)cleanNode2).Number == 0)
{
Node newNumberNode;
newNumberNode = new NodeNumber(cleanNode1.ContainsX(), cleanNode1.ContainsP(), ((NodeNumber)cleanNode1).Number);
return(newNumberNode);
}
else if (cleanNode1.ContainsX() == cleanNode2.ContainsX())
{
if (cleanNode1.ContainsP() == cleanNode2.ContainsP())
{
Node newNumberNode;
newNumberNode = new NodeNumber(cleanNode1.ContainsX(), cleanNode1.ContainsP(), ((NodeNumber)cleanNode1).Number + ((NodeNumber)cleanNode2).Number);
return(newNumberNode);
}
}
}
//none of the nodes are numbers, so they need to be cleaned!
Node trash;
if (cleanNode1 is NodeLN && cleanNode2 is NodeLN)
{
Node nodeln = new NodeLN();
Node nodeTim = new NodeTimes();
nodeTim.AddNode1(cleanNode1.Node1);
nodeTim.AddNode2(cleanNode2.Node1);
nodeln.AddNode1(nodeTim);
nodeln.MakeNodeClean(null, out trash);
return(nodeln);
}
return(null);
}
public override Node MakeNodeClean(Node prevNodeNumber, out Node replacementNode)
{
Node garbage;
if (node1 is NodeLN && node2 is NodeLN) //exception
{
Node nodeDiv = new NodeDivision();
Node nodeln = new NodeLN();
nodeln.AddNode1(nodeDiv);
nodeDiv.AddNode1(Node1.Node1);
nodeDiv.AddNode2(node2.Node1);
nodeln.MakeNodeClean(null, out garbage);
replacementNode = null;
return(nodeln);
}
else
{
Node nodePlus = new NodePlus();
nodePlus.AddNode1(node1);
if (node2 is NodeNumber)
{
((NodeNumber)node2).SwapPositivity();
nodePlus.AddNode2(node2);
}
else if (node2 is NodeMinus)
{
Node newNode2 = node2.MakeNodeClean(null, out garbage); //node2 is now nodeplus
((NodePlus)newNode2).SwapPositivity();
nodePlus.AddNode2(newNode2);
}
else
{
Node nodeTimes = new NodeTimes();
Node nodeNumber = new NodeNumber(false, false, -1);
nodeTimes.AddNode1(nodeNumber);
nodeTimes.AddNode2(node2);
nodePlus.AddNode2(nodeTimes);
}
replacementNode = null;
nodePlus.MakeNodeClean(null, out garbage);
return(nodePlus);
}
}
