Home
last modified time | relevance | path

Searched refs:maxroots (Results 1 – 5 of 5) sorted by relevance

/dports/math/p5-Math-Prime-Util-GMP/Math-Prime-Util-GMP-0.52/
H A Dutility.c1667 if (*nroots >= maxroots || dg <= 0) return; in polyz_roots()
1743 polyz_roots(roots, nroots, maxroots, ph, dh, NMOD); in polyz_roots()
1744 if (*nroots < maxroots) { in polyz_roots()
1747 polyz_roots(roots, nroots, maxroots, pq, dq, NMOD); in polyz_roots()
1751 polyz_roots(roots, nroots, maxroots, pq, dq, NMOD); in polyz_roots()
1752 if (*nroots < maxroots) { in polyz_roots()
1753 polyz_roots(roots, nroots, maxroots, ph, dh, NMOD); in polyz_roots()
1774 void polyz_roots_modp(mpz_t** roots, long *nroots, long maxroots, in polyz_roots_modp() argument
1807 if (maxroots > dP || maxroots == 0) in polyz_roots_modp()
1808 maxroots = dP; in polyz_roots_modp()
[all …]
H A Decpp.c347 static int find_roots(long D, int poly_index, mpz_t N, mpz_t** roots, int maxroots) in find_roots() argument
366 polyz_roots_modp(roots, &nroots, maxroots, T, dT, N); in find_roots()
516 long D, int poly_index, mpz_t m, mpz_t q, mpz_t N, int maxroots) in find_curve() argument
530 nroots = find_roots(D, poly_index, N, &roots, maxroots); in find_curve()
H A Dutility.h74 extern void polyz_roots_modp(mpz_t** roots, long *nroots, long maxroots,
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/utils/
H A Drenumber.cpp1002 index_t maxroots = 0; in variant_translate_index() local
1004 maxroots += get_poly(side)->deg; in variant_translate_index()
1014 if (middle == min || (delta <= i && delta + maxroots > i)) { in variant_translate_index()
1018 index_t run = std::min(3 * maxroots, max - i0); in variant_translate_index()
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dsepa_oddcycle.c2281 unsigned int maxroots; /* maximum of level graph roots */ in separateHeur() local
2446 …maxroots = (unsigned int) SCIPceil(scip, sepadata->offsettestvars + (0.02 * nbinvars * sepadata->p… in separateHeur()
2451 for( i = (unsigned int) sepadata->lastroot; i < graph.maxnodes && rootcounter < maxroots in separateHeur()