Go to the source code of this file.
|  | 
| static double | ceilDecimal (double x, int decPow) | 
|  | rounds xup to the next decimal power 10 ^decPowMore...
 | 
|  | 
| static double | roundDecimal (double x, int decPow) | 
|  | rounds xto the next decimal power 10 ^decPowMore...
 | 
|  | 
| static double | intervalTransformation (double x, double left1, double right1, double left2, double right2) | 
|  | transforms point xof interval [left1,right1] into interval [left2,right2]  More...
 | 
|  | 
| double | linear2log (double x) | 
|  | Transforms a number from linear to log10 scale. Avoids negative logarithms by adding 1.  More... 
 | 
|  | 
| double | log2linear (double x) | 
|  | Transforms a number from log10 to to linear scale. Subtracts the 1 added by linear2log(double)  More... 
 | 
|  | 
| bool | isOdd (UInt x) | 
|  | Returns true if the given interger is odd.  More... 
 | 
|  | 
| template<typename T > | 
| T | round (T x) | 
|  | Rounds the value.  More... 
 | 
|  | 
| static bool | approximatelyEqual (DoubleReal a, DoubleReal b, DoubleReal tol) | 
|  | Returns if ais approximately equalb, allowing a tolerance oftol.  More...
 | 
|  | 
| template<typename T > | 
| T | gcd (T a, T b) | 
|  | Returns the greatest common divisor (gcd) of two numbers by applying the Euclidean algorithm.  More... 
 | 
|  | 
| template<typename T > | 
| T | gcd (T a, T b, T &u1, T &u2) | 
|  | Returns the greatest common divisor by applying the extended Euclidean algorithm (Knuth TAoCP vol. 2, p342). Calculates u1, u2 and u3 (which is returned) so that a * u1 + b * u2 = u3 = gcd(a, b, u1, u2)  More... 
 | 
|  |