| /dports/math/eclib/eclib-20210318/tests/out_no_ntl/ |
| H A D | tsat.out | 14 Points were proved 2-saturated (max q used = 19)
16 Points were proved 3-saturated (max q used = 83)
18 Points were proved 5-saturated (max q used = 103)
20 Points were proved 7-saturated (max q used = 233)
22 Points were proved 11-saturated (max q used = 313)
24 Points were proved 13-saturated (max q used = 67)
26 Points were proved 17-saturated (max q used = 277)
28 Points were proved 19-saturated (max q used = 557)
32 Points were proved 29-saturated (max q used = 239)
34 Points were proved 31-saturated (max q used = 557)
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/ulong_extras/ |
| H A D | randprime.c | 23 mp_limb_t n_randprime(flint_rand_t state, ulong bits, int proved) in n_randprime() argument
38 rand = n_nextprime(rand, proved); in n_randprime()
49 rand = n_nextprime(rand, proved); in n_randprime()
56 mp_limb_t n_randtest_prime(flint_rand_t state, int proved) in n_randtest_prime() argument
58 return n_randprime(state, 2 + n_randint(state, FLINT_BITS - 1), proved); in n_randtest_prime()
|
| H A D | factor.c | 21 static int is_prime(mp_limb_t n, int proved) in is_prime() argument
23 return proved ? n_is_prime(n) : n_is_probabprime(n); in is_prime()
26 void n_factor(n_factor_t * factors, mp_limb_t n, int proved) in n_factor() argument
36 if (is_prime(cofactor, proved)) in n_factor()
60 if ((factor >= cutoff) && !is_prime(factor, proved)) in n_factor()
|
| H A D | factor_partial.c | 20 int is_prime2(mp_limb_t n, int proved) in is_prime2() argument
22 if (proved) return n_is_prime(n); in is_prime2()
26 mp_limb_t n_factor_partial(n_factor_t * factors, mp_limb_t n, mp_limb_t limit, int proved) in n_factor_partial() argument
42 if (is_prime2(cofactor, proved)) in n_factor_partial()
66 if ((factor >= cutoff) && !is_prime2(factor, proved)) in n_factor_partial()
|
| /dports/math/e-antic/flint2-ae7ec89/ulong_extras/ |
| H A D | randprime.c | 23 mp_limb_t n_randprime(flint_rand_t state, ulong bits, int proved) in n_randprime() argument
38 rand = n_nextprime(rand, proved); in n_randprime()
49 rand = n_nextprime(rand, proved); in n_randprime()
56 mp_limb_t n_randtest_prime(flint_rand_t state, int proved) in n_randtest_prime() argument
58 return n_randprime(state, 2 + n_randint(state, FLINT_BITS - 1), proved); in n_randtest_prime()
|
| H A D | factor.c | 21 static int is_prime(mp_limb_t n, int proved) in is_prime() argument
23 return proved ? n_is_prime(n) : n_is_probabprime(n); in is_prime()
26 void n_factor(n_factor_t * factors, mp_limb_t n, int proved) in n_factor() argument
36 if (is_prime(cofactor, proved)) in n_factor()
60 if ((factor >= cutoff) && !is_prime(factor, proved)) in n_factor()
|
| H A D | factor_partial.c | 20 int is_prime2(mp_limb_t n, int proved) in is_prime2() argument
22 if (proved) return n_is_prime(n); in is_prime2()
26 mp_limb_t n_factor_partial(n_factor_t * factors, mp_limb_t n, mp_limb_t limit, int proved) in n_factor_partial() argument
42 if (is_prime2(cofactor, proved)) in n_factor_partial()
66 if ((factor >= cutoff) && !is_prime2(factor, proved)) in n_factor_partial()
|
| /dports/math/flint2/flint-2.8.4/ulong_extras/ |
| H A D | randprime.c | 23 mp_limb_t n_randprime(flint_rand_t state, ulong bits, int proved) in n_randprime() argument
38 rand = n_nextprime(rand, proved); in n_randprime()
49 rand = n_nextprime(rand, proved); in n_randprime()
56 mp_limb_t n_randtest_prime(flint_rand_t state, int proved) in n_randtest_prime() argument
58 return n_randprime(state, 2 + n_randint(state, FLINT_BITS - 1), proved); in n_randtest_prime()
|
| H A D | factor.c | 21 static int is_prime(mp_limb_t n, int proved) in is_prime() argument
23 return proved ? n_is_prime(n) : n_is_probabprime(n); in is_prime()
26 void n_factor(n_factor_t * factors, mp_limb_t n, int proved) in n_factor() argument
36 if (is_prime(cofactor, proved)) in n_factor()
60 if ((factor >= cutoff) && !is_prime(factor, proved)) in n_factor()
|
| H A D | factor_partial.c | 20 int is_prime2(mp_limb_t n, int proved) in is_prime2() argument
22 if (proved) return n_is_prime(n); in is_prime2()
26 mp_limb_t n_factor_partial(n_factor_t * factors, mp_limb_t n, mp_limb_t limit, int proved) in n_factor_partial() argument
42 if (is_prime2(cofactor, proved)) in n_factor_partial()
66 if ((factor >= cutoff) && !is_prime2(factor, proved)) in n_factor_partial()
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz_factor/ |
| H A D | factor_smooth.c | 41 int _is_prime(const fmpz_t n, int proved) in _is_prime() argument
43 if (proved) in _is_prime()
50 slong bits, int proved) in fmpz_factor_smooth() argument
169 if (proved != -1 && _is_prime(n2, proved)) in fmpz_factor_smooth()
188 ret = fmpz_factor_smooth(fac, root, bits, proved); in fmpz_factor_smooth()
229 if (_is_prime(n2, proved)) in fmpz_factor_smooth()
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_factor/ |
| H A D | factor_smooth.c | 41 int _is_prime(const fmpz_t n, int proved) in _is_prime() argument
43 if (proved) in _is_prime()
50 slong bits, int proved) in fmpz_factor_smooth() argument
169 if (proved != -1 && _is_prime(n2, proved)) in fmpz_factor_smooth()
188 ret = fmpz_factor_smooth(fac, root, bits, proved); in fmpz_factor_smooth()
229 if (_is_prime(n2, proved)) in fmpz_factor_smooth()
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz/ |
| H A D | nextprime.c | 17 void fmpz_nextprime(fmpz_t res, const fmpz_t n, int proved) in fmpz_nextprime() argument
34 *res = n_nextprime(*n, proved); in fmpz_nextprime()
55 if (proved) in fmpz_nextprime()
62 fmpz_nextprime(res, res, proved); in fmpz_nextprime()
|
| H A D | randprime.c | 16 void fmpz_randprime(fmpz_t f, flint_rand_t state, flint_bitcnt_t bits, int proved) in fmpz_randprime() argument
21 *f = n_randprime(state, bits, proved); in fmpz_randprime()
38 fmpz_nextprime(f, f, proved); in fmpz_randprime()
|
| /dports/math/flint2/flint-2.8.4/fmpz/ |
| H A D | nextprime.c | 17 void fmpz_nextprime(fmpz_t res, const fmpz_t n, int proved) in fmpz_nextprime() argument
34 *res = n_nextprime(*n, proved); in fmpz_nextprime()
55 if (proved) in fmpz_nextprime()
62 fmpz_nextprime(res, res, proved); in fmpz_nextprime()
|
| H A D | randprime.c | 16 void fmpz_randprime(fmpz_t f, flint_rand_t state, flint_bitcnt_t bits, int proved) in fmpz_randprime() argument
21 *f = n_randprime(state, bits, proved); in fmpz_randprime()
38 fmpz_nextprime(f, f, proved); in fmpz_randprime()
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz/ |
| H A D | nextprime.c | 17 void fmpz_nextprime(fmpz_t res, const fmpz_t n, int proved) in fmpz_nextprime() argument
34 *res = n_nextprime(*n, proved); in fmpz_nextprime()
55 if (proved) in fmpz_nextprime()
62 fmpz_nextprime(res, res, proved); in fmpz_nextprime()
|
| H A D | randprime.c | 16 void fmpz_randprime(fmpz_t f, flint_rand_t state, flint_bitcnt_t bits, int proved) in fmpz_randprime() argument
21 *f = n_randprime(state, bits, proved); in fmpz_randprime()
38 fmpz_nextprime(f, f, proved); in fmpz_randprime()
|
| /dports/math/flint2/flint-2.8.4/fmpz_factor/ |
| H A D | factor_smooth.c | 41 int _is_prime(const fmpz_t n, int proved) in _is_prime() argument
43 if (proved) in _is_prime()
68 slong bits, int proved) in fmpz_factor_smooth() argument
187 if (proved != -1 && _is_prime(n2, proved)) in fmpz_factor_smooth()
206 ret = fmpz_factor_smooth(fac, root, bits, proved); in fmpz_factor_smooth()
255 if (_is_prime(n2, proved)) in fmpz_factor_smooth()
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz_mat/test/ |
| H A D | t-det_modular.c | 37 int proved = n_randlimb(state) % 2; in main() local
48 fmpz_mat_det_modular(det2, A, proved); in main()
67 int proved = n_randlimb(state) % 2; in main() local
76 fmpz_mat_det_modular(det2, A, proved); in main()
|
| H A D | t-det_modular_accelerated.c | 37 int proved = n_randlimb(state) % 2; in main() local
48 fmpz_mat_det_modular_accelerated(det2, A, proved); in main()
67 int proved = n_randlimb(state) % 2; in main() local
76 fmpz_mat_det_modular_accelerated(det2, A, proved); in main()
|
| /dports/math/flint2/flint-2.8.4/fmpz_mat/test/ |
| H A D | t-det_modular.c | 37 int proved = n_randlimb(state) % 2; in main() local
48 fmpz_mat_det_modular(det2, A, proved); in main()
67 int proved = n_randlimb(state) % 2; in main() local
76 fmpz_mat_det_modular(det2, A, proved); in main()
|
| H A D | t-det_modular_accelerated.c | 37 int proved = n_randlimb(state) % 2; in main() local
48 fmpz_mat_det_modular_accelerated(det2, A, proved); in main()
67 int proved = n_randlimb(state) % 2; in main() local
76 fmpz_mat_det_modular_accelerated(det2, A, proved); in main()
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_mat/test/ |
| H A D | t-det_modular_accelerated.c | 37 int proved = n_randlimb(state) % 2; in main() local
48 fmpz_mat_det_modular_accelerated(det2, A, proved); in main()
67 int proved = n_randlimb(state) % 2; in main() local
76 fmpz_mat_det_modular_accelerated(det2, A, proved); in main()
|
| H A D | t-det_modular.c | 37 int proved = n_randlimb(state) % 2; in main() local
48 fmpz_mat_det_modular(det2, A, proved); in main()
67 int proved = n_randlimb(state) % 2; in main() local
76 fmpz_mat_det_modular(det2, A, proved); in main()
|