Lines Matching refs:Then
120 and static then install (by default) into /usr/lib as well as install the header files in /usr/include. The shared
385 represents the default integer which is zero. If the functions returns MP\_OKAY then the mp\_int is ready to be used
453 at once. If the function returns MP\_OKAY then all of the mp\_int variables are ready to use, otherwise none of them
875 differ it will return immediately based on their signs. If the signs are equal then it will compare the digits
1059 Which will divide $a$ by $2^b$, store the quotient in ``c'' and the remainder in ``d'. If $b \le 0$ then the
1067 $f(x) = \sum_{i=0}^{k} y_ix^k$ for any vector $\vec y$ then the array of digits in $\vec y$ are said to be
1160 sized inputs. Then followed by the Comba and baseline multipliers.
1271 good Karatsuba squaring and multiplication points. Then it proceeds to find Toom-Cook points. Note that the Toom-Cook
1584 values of $b$. If particularly large roots are required then a factor method could be used instead. For example,
1595 outcome in ``result''. That is if $result = 0$ then $a$ is not divisible by the primes, otherwise it is. Note that
1605 equal to $b$ or not. If the values are equal then $a$ is probably prime and $result$ is set to one. Otherwise $result$
1806 then the result will be $-1$ when $a$ is not a quadratic residue modulo $p$. The result will be $0$ if $a$ divides $p$
