/// <summary>
/// Solve an expression while replacing the 'x'es to a given value
/// </summary>
/// <param name="expression"></param>
/// <param name="x"></param>
/// <returns></returns>
public static float SolveWithX(string expression, float x)
{
expression = DerivativeSolver.FixFunctionExpression(expression).Replace("x", x.ToString());
// Common variables
Queue <string> q = new Queue <string>();
Stack <string> s = new Stack <string>();
//Perform shanting yard algorithem
StringBuilder sb = new StringBuilder();
for (int i = 0; i < expression.Length; i++)
{
if (Cleaner.Splitters.Contains(expression[i]))
{
sb.Replace(" ", "");
if (sb.Length > 0)
{
q.Enqueue(sb.ToString());
}
switch (expression[i])
{
case '(':
s.Push("(");
break;
case ')':
while (s.Count > 0 && s.Peek() != "(")
{
q.Enqueue(s.Pop());
}
s.Pop();
break;
default:
byte ov = Cleaner.GetOV(expression[i]);
while (s.Count > 0 && Cleaner.GetOV(s.Peek()[0]) != 0 &&
Cleaner.GetOV(s.Peek()[0]) >= ov)
{
q.Enqueue(s.Pop());
}
s.Push(expression[i].ToString());
break;
}
sb.Clear();
continue;
}
sb.Append(expression[i]);
}
sb.Replace(" ", "");
if (sb.Length > 0)
{
q.Enqueue(sb.ToString());
}
while (s.Count > 0)
{
q.Enqueue(s.Pop());
}
//Stack evaluator
while (q.Count > 0)
{
string deq = q.Dequeue();
// Is operator?
if (Cleaner.Splitters.Contains(deq[0]))
{
float a = float.Parse(s.Pop());
float b = s.Count > 0 ? float.Parse(s.Pop()) : 0;
s.Push(Evaluate(b, a, deq[0]).ToString());
}
else
{
s.Push(deq);
}
}
return(float.Parse(s.Pop()));
}
/// <summary>
/// Returns the clean 2nd derivative of a function
/// </summary>
/// <param name="func"></param>
/// <returns></returns>
public static string Get2ndDerivative(string func)
{
return(Cleaner.Clean(Get2ndDerivativeRaw(func)));
}
