53 static fInt ConvertToFraction(int);                       /* Use this to convert an INT to a FINT */
113 	fInt fPositiveOne = ConvertToFraction(1);  in fExponential()
114 	fInt fZERO = ConvertToFraction(0);  in fExponential()
151 	fInt fNegativeOne = ConvertToFraction(-1);  in fNaturalLog()
152 	fInt solution = ConvertToFraction(0); /*Starting off with baseline of 0 */  in fNaturalLog()
192 	fInt f_CONSTANT_NEG13 = ConvertToFraction(-13);  in fDecodeLogisticFuse()
193 	fInt f_CONSTANT1 = ConvertToFraction(1);  in fDecodeLogisticFuse()
218 static fInt ConvertToFraction(int X) /*Add all range checking here. Is it possible to make fInt a p…  in ConvertToFraction()  function
232 	fInt CONSTANT_NEGONE = ConvertToFraction(-1);  in fNegate()
286 		return ConvertToFraction(X);  in GetScaledFraction()
288 	fValue = fDivide(ConvertToFraction(X * uPow(-1, bNEGATED)), ConvertToFraction(factor));  in GetScaledFraction()
361 	fZERO = ConvertToFraction(0);  in fDivide()
404 	fInt fZERO = ConvertToFraction(0);  in fSqrt()
427 	twoShifted = ConvertToFraction(2);  in fSqrt()
428 	x_new = ConvertToFraction(seed);  in fSqrt()
459 	f_CONSTANT100 = ConvertToFraction(100);  in SolveQuadracticEqn()
460 	f_CONSTANT10 = ConvertToFraction(10);  in SolveQuadracticEqn()
468 	temp = fMultiply(ConvertToFraction(4), A); /* root = 4*A */  in SolveQuadracticEqn()
476 	root_first = fDivide(root_first, ConvertToFraction(2)); /* [b +- Sqrt(b^2 - 4AC)]/[2] */  in SolveQuadracticEqn()
479 	root_second = fDivide(root_second, ConvertToFraction(2)); /* [b +- Sqrt(b^2 - 4AC)]/[2] */  in SolveQuadracticEqn()