#include <givintsqrootmod.h>
Inheritance diagram for IntSqrtModDom< MyRandIter >:
Collaboration diagram for IntSqrtModDom< MyRandIter >:
Public Member Functions | |
| bool | set (Container1 &setint, Container2 &setpwd, const Rep &a, unsigned long loops=0) const |
| Factors with primes. | |
| Rep & | Erathostene (Rep &, const Rep &p) const |
| returns a small factor | |
| bool | isUnit (const Rep &x) const |
| isUnit | |
| bool | isDivisor (const Element &a, const Element &b) const |
| isDivisor (a, b) Test if b | a. | |
Detailed Description
template<class MyRandIter = GivRandom>
class Givaro::IntSqrtModDom< MyRandIter >
Modular square roots.
- Examples
- examples/Integer/ModularSquareRoot.C.
The documentation for this class was generated from the following files:
- givintsqrootmod.h (4.1.1)
- givintsqrootmod.inl (4.1.1)
