lib/tommath/tommath.tex

259 In most cases how an algorithm is explained and how it is actually implemented are two very different concepts.  For
717 and it was not deemed ideal by the author of LibTomMath to force developers to have signal handlers for such cases.
1086 the most.  For example, this will happen in cases where there is not a carry to fill the last position.  Step two fixes the sign for
1407 Often a mp\_int must be set to a relatively small value such as $1$ or $2$.  For these cases the mp\_set algorithm is useful.
1855 flag.  A high level addition is actually performed as a series of eight separate cases which can be optimized down to three unique cases.
1914 specific cases need to be handled.  The return code of the unsigned operations at step 1.2, 2.1.2 and 2.2.2 are
2249 After the trivial cases of inputs have been handled the sliding window is setup.  Much like the case of algorithm mp\_lshd a sliding window that
2441 We first avoid cases of $b \le 0$ by simply mp\_zero()'ing the destination in such cases.  Next if $2^b$ is larger
4520 This algorithm determines if a value is in Diminished Radix form.  Step 1 rejects obvious cases where fewer than two digits are
5178 the two cases of $mode = 1$ and $mode = 2$ respectively.
5315 cases $\hat k = \lfloor (y_t\beta + y_{t-1}) / x_s \rfloor$ and $\hat k x_s \ge y_t\beta + y_{t-1} - x_s + 1$.  The latter portion of the inequalility
5455 After the first two trivial cases of inputs are handled the variable $q$ is setup to receive the digits of the quotient.  Two unsigned copies of the
5481 outside their respective boundaries.  For example, if $t = 0$ or $i \le 1$ then the digits would be undefined.  In those cases the digits should
5499 Lines 109 and 113 handle the two trivial cases of inputs which are division by zero and dividend smaller than the divisor
5500 respectively.  After the two trivial cases all of the temporary variables are initialized.  Line 148 determines the sign of
6037 The algorithms presented so far cannot handle inputs which are zero or negative.  The following algorithm can handle all input cases properly
6083 The first two steps handle the cases where either one of or both inputs are zero.  If either input is zero the greatest common divisor is the
6109 trivial cases of inputs are handled on lines 24 through 30.  After those lines the inputs are assumed to be non-zero.
6304 Step numbers one and two handle the trivial cases of $a = 0$ and $a = 1$ respectively.  Step five determines the number of two factors in the
6323 The two simple cases of $a = 0$ and $a = 1$ are handled at the very beginning to simplify the algorithm.  If the input is non-trivial the algorithm