| taylorExpansion(SymbolicExpression, int, NumericExpression[]) |  | 0% | | 0% | 7 | 7 | 30 | 30 | 1 | 1 |
| tryToExpand(SymbolicExpression, ExpressionSubstituter.SubstituterState) | | 0% | | 0% | 8 | 8 | 30 | 30 | 1 | 1 |
| reduceModLimits(NumericExpression) | | 0% | | 0% | 7 | 7 | 20 | 20 | 1 | 1 |
| isBounded(NumericExpression) | | 0% | | 0% | 13 | 13 | 20 | 20 | 1 | 1 |
| isConstantMultiple(NumericExpression, NumericSymbolicConstant) | | 0% | | 0% | 14 | 14 | 27 | 27 | 1 | 1 |
| findExpansionPoint(NumericExpression[], int) | | 0% | | 0% | 6 | 6 | 15 | 15 | 1 | 1 |
| checkDomain(NumericExpression[], NumericExpression[], NumericExpression[]) | | 0% | | 0% | 4 | 4 | 16 | 16 | 1 | 1 |
| isBoundedApplicationOfDeriv(SymbolicExpression, int, NumericExpression[]) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| getNumRealFunctionInputs(SymbolicExpression) | | 0% | | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| findDifferentiableClaim(SymbolicExpression) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| isBoundedApplication(SymbolicExpression, NumericExpression[]) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| toArray(SymbolicObject, int) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| TaylorSubstituter(PreUniverse, ObjectFactory, SymbolicTypeFactory, Reasoner, NumericSymbolicConstant[], int[]) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| substituteExpression(SymbolicExpression, ExpressionSubstituter.SubstituterState) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| newState() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |