Lines Matching full:solution
123 fInt solution = fPositiveOne; /*Starting off with baseline of 1 */ in fExponential() local
138 solution = fMultiply(solution, GetScaledFraction(expk_array[i], 10000)); in fExponential()
145 solution = fMultiply(solution, error_term); in fExponential()
148 solution = fDivide(fPositiveOne, solution); in fExponential()
150 return solution; in fExponential()
158 fInt solution = ConvertToFraction(0); /*Starting off with baseline of 0 */ in fNaturalLog() local
168 solution = fAdd(solution, GetScaledFraction(logk_array[i], 10000)); in fNaturalLog()
175 return fAdd(solution, error_term); in fNaturalLog()
548 fInt solution; in fRoundUpByStepSize() local
550 solution = fDivide(A, fStepSize); in fRoundUpByStepSize()
551 solution.partial.decimal = 0; /*All fractional digits changes to 0 */ in fRoundUpByStepSize()
554 solution.partial.real += 1; /*Error term of 1 added */ in fRoundUpByStepSize()
556 solution = fMultiply(solution, fStepSize); in fRoundUpByStepSize()
557 solution = fAdd(solution, fStepSize); in fRoundUpByStepSize()
559 return solution; in fRoundUpByStepSize()