]> www.ginac.de Git - ginac.git/blob - ginac/polynomial/cra_garner.hpp
mod_gcd: naive hack to chose a 'good' prime (to speed up gcd computation).
[ginac.git] / ginac / polynomial / cra_garner.hpp
1 #ifndef CL_INTEGER_CRA
2 #define CL_INTEGER_CRA
3 #include <vector>
4 #include <cln/integer.h>
5
6 namespace cln
7 {
8 extern cl_I integer_cra(const std::vector<cl_I>& residues,
9                         const std::vector<cl_I>& moduli);
10 }
11 #endif // CL_INTEGER_CRA
12