| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_poly/ |
| H A D | compose.c | 16 _nmod_poly_compose(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_compose() argument
19 if (len1 == 1) in _nmod_poly_compose()
22 res[0] = _nmod_poly_evaluate_nmod(poly1, len1, poly2[0], mod); in _nmod_poly_compose()
23 else if (len1 <= 7) in _nmod_poly_compose()
24 _nmod_poly_compose_horner(res, poly1, len1, poly2, len2, mod); in _nmod_poly_compose()
32 const slong len1 = poly1->length; in nmod_poly_compose() local
35 if (len1 == 0) in nmod_poly_compose()
39 else if (len1 == 1 || len2 == 0) in nmod_poly_compose()
47 const slong lenr = (len1 - 1) * (len2 - 1) + 1; in nmod_poly_compose()
52 _nmod_poly_compose_horner(res->coeffs, poly1->coeffs, len1, in nmod_poly_compose()
[all …]
|
| H A D | mulhigh_classical.c | 43 if (start < len1) in _nmod_poly_mulhigh_classical()
49 m = FLINT_MAX(len1 - 1, start); in _nmod_poly_mulhigh_classical()
51 mpn_mul_1(res + m, poly2 + m - len1 + 1, len2 - 1 + len1 - m, in _nmod_poly_mulhigh_classical()
52 poly1[len1 - 1]); in _nmod_poly_mulhigh_classical()
56 for (i = m - len2 + 1; i < len1 - 1; i++) in _nmod_poly_mulhigh_classical()
64 _nmod_vec_reduce(res, res, len1 + len2 - 1, mod); in _nmod_poly_mulhigh_classical()
69 if (start < len1) in _nmod_poly_mulhigh_classical()
77 m = FLINT_MAX(len1 - 1, start); in _nmod_poly_mulhigh_classical()
78 _nmod_vec_scalar_mul_nmod(res + m, poly2 + m - len1 + 1, in _nmod_poly_mulhigh_classical()
79 len2 - 1 + len1 - m, poly1[len1 - 1], mod); in _nmod_poly_mulhigh_classical()
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/nmod_poly/ |
| H A D | compose.c | 16 _nmod_poly_compose(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_compose() argument
19 if (len1 == 1) in _nmod_poly_compose()
22 res[0] = _nmod_poly_evaluate_nmod(poly1, len1, poly2[0], mod); in _nmod_poly_compose()
23 else if (len1 <= 7) in _nmod_poly_compose()
24 _nmod_poly_compose_horner(res, poly1, len1, poly2, len2, mod); in _nmod_poly_compose()
32 const slong len1 = poly1->length; in nmod_poly_compose() local
35 if (len1 == 0) in nmod_poly_compose()
39 else if (len1 == 1 || len2 == 0) in nmod_poly_compose()
47 const slong lenr = (len1 - 1) * (len2 - 1) + 1; in nmod_poly_compose()
52 _nmod_poly_compose_horner(res->coeffs, poly1->coeffs, len1, in nmod_poly_compose()
[all …]
|
| H A D | mulhigh_classical.c | 43 if (start < len1) in _nmod_poly_mulhigh_classical()
49 m = FLINT_MAX(len1 - 1, start); in _nmod_poly_mulhigh_classical()
51 mpn_mul_1(res + m, poly2 + m - len1 + 1, len2 - 1 + len1 - m, in _nmod_poly_mulhigh_classical()
52 poly1[len1 - 1]); in _nmod_poly_mulhigh_classical()
56 for (i = m - len2 + 1; i < len1 - 1; i++) in _nmod_poly_mulhigh_classical()
64 _nmod_vec_reduce(res, res, len1 + len2 - 1, mod); in _nmod_poly_mulhigh_classical()
69 if (start < len1) in _nmod_poly_mulhigh_classical()
77 m = FLINT_MAX(len1 - 1, start); in _nmod_poly_mulhigh_classical()
78 _nmod_vec_scalar_mul_nmod(res + m, poly2 + m - len1 + 1, in _nmod_poly_mulhigh_classical()
79 len2 - 1 + len1 - m, poly1[len1 - 1], mod); in _nmod_poly_mulhigh_classical()
[all …]
|
| /dports/math/flint2/flint-2.8.4/nmod_poly/ |
| H A D | compose.c | 16 _nmod_poly_compose(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_compose() argument
19 if (len1 == 1) in _nmod_poly_compose()
22 res[0] = _nmod_poly_evaluate_nmod(poly1, len1, poly2[0], mod); in _nmod_poly_compose()
23 else if (len1 <= 7) in _nmod_poly_compose()
24 _nmod_poly_compose_horner(res, poly1, len1, poly2, len2, mod); in _nmod_poly_compose()
32 const slong len1 = poly1->length; in nmod_poly_compose() local
35 if (len1 == 0) in nmod_poly_compose()
39 else if (len1 == 1 || len2 == 0) in nmod_poly_compose()
47 const slong lenr = (len1 - 1) * (len2 - 1) + 1; in nmod_poly_compose()
52 _nmod_poly_compose_horner(res->coeffs, poly1->coeffs, len1, in nmod_poly_compose()
[all …]
|
| /dports/math/py-or-tools/or-tools-9.2/examples/contrib/ |
| H A D | pandigital_numbers.py | 78 def main(base=10, start=1, len1=1, len2=4): argument
104 toNum(solver, [x[i] for i in range(len1)], num1, base)
105 toNum(solver, [x[i] for i in range(len1, len1 + len2)], num2, base)
112 solver.Add(x[len1] > 0)
113 solver.Add(x[len1 + len2] > 0)
147 def print_solution(x, len1, len2, x_len): argument
148 print("".join([str(x[i]) for i in range(len1)]), "*", end=" ")
149 print("".join([str(x[i]) for i in range(len1, len1 + len2)]), "=", end=" ")
162 for len1 in range(1 + (x_len)):
164 if x_len > len1 + len2:
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz_poly/ |
| H A D | resultant.c | 18 void _fmpz_poly_resultant(fmpz_t res, const fmpz * poly1, slong len1, in _fmpz_poly_resultant() argument
21 slong bits1 = FLINT_ABS(_fmpz_vec_max_bits(poly1, len1)); in _fmpz_poly_resultant()
25 _fmpz_poly_resultant_modular(res, poly1, len1, poly2, len2); in _fmpz_poly_resultant()
27 _fmpz_poly_resultant_euclidean(res, poly1, len1, poly2, len2); in _fmpz_poly_resultant()
33 slong len1 = poly1->length; in fmpz_poly_resultant() local
36 if (len1 == 0 || len2 == 0) in fmpz_poly_resultant()
38 else if (len1 >= len2) in fmpz_poly_resultant()
39 _fmpz_poly_resultant(res, poly1->coeffs, len1, poly2->coeffs, len2); in fmpz_poly_resultant()
42 _fmpz_poly_resultant(res, poly2->coeffs, len2, poly1->coeffs, len1); in fmpz_poly_resultant()
43 if ((len1 > 1) && (!(len1 & WORD(1)) & !(len2 & WORD(1)))) in fmpz_poly_resultant()
|
| H A D | compose_series.c | 20 _fmpz_poly_compose_series(fmpz * res, const fmpz * poly1, slong len1, in _fmpz_poly_compose_series() argument
23 if (len1 <= 10) in _fmpz_poly_compose_series()
24 _fmpz_poly_compose_series_horner(res, poly1, len1, poly2, len2, n); in _fmpz_poly_compose_series()
26 _fmpz_poly_compose_series_brent_kung(res, poly1, len1, poly2, len2, n); in _fmpz_poly_compose_series()
33 slong len1 = poly1->length; in fmpz_poly_compose_series() local
44 if (len1 == 0 || n == 0) in fmpz_poly_compose_series()
50 if (len2 == 0 || len1 == 1) in fmpz_poly_compose_series()
56 lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n); in fmpz_poly_compose_series()
57 len1 = FLINT_MIN(len1, lenr); in fmpz_poly_compose_series()
63 _fmpz_poly_compose_series(res->coeffs, poly1->coeffs, len1, in fmpz_poly_compose_series()
[all …]
|
| H A D | div_preinv.c | 21 slong len1 = len1_in; in _fmpz_poly_div_preinv() local
22 slong n = len1 - len2 + 1; in _fmpz_poly_div_preinv()
33 _fmpz_poly_divrem_preinv(Q + start, a + start, len1 - start, in _fmpz_poly_div_preinv()
36 len1 -= len2; in _fmpz_poly_div_preinv()
41 A_rev = _fmpz_vec_init(len1); in _fmpz_poly_div_preinv()
43 _fmpz_poly_reverse(A_rev, a, len1, len1); in _fmpz_poly_div_preinv()
44 _fmpz_poly_mullow(Q, A_rev, len1, B_inv, len2, n); in _fmpz_poly_div_preinv()
49 _fmpz_vec_clear(A_rev, len1); in _fmpz_poly_div_preinv()
58 slong len1 = A->length, len2 = B_inv->length; in fmpz_poly_div_preinv() local
59 slong qlen = len1 - len2 + 1; in fmpz_poly_div_preinv()
[all …]
|
| /dports/math/flint2/flint-2.8.4/fmpz_poly/ |
| H A D | resultant.c | 18 void _fmpz_poly_resultant(fmpz_t res, const fmpz * poly1, slong len1, in _fmpz_poly_resultant() argument
21 slong bits1 = FLINT_ABS(_fmpz_vec_max_bits(poly1, len1)); in _fmpz_poly_resultant()
25 _fmpz_poly_resultant_modular(res, poly1, len1, poly2, len2); in _fmpz_poly_resultant()
27 _fmpz_poly_resultant_euclidean(res, poly1, len1, poly2, len2); in _fmpz_poly_resultant()
33 slong len1 = poly1->length; in fmpz_poly_resultant() local
36 if (len1 == 0 || len2 == 0) in fmpz_poly_resultant()
38 else if (len1 >= len2) in fmpz_poly_resultant()
39 _fmpz_poly_resultant(res, poly1->coeffs, len1, poly2->coeffs, len2); in fmpz_poly_resultant()
42 _fmpz_poly_resultant(res, poly2->coeffs, len2, poly1->coeffs, len1); in fmpz_poly_resultant()
43 if ((len1 > 1) && (!(len1 & WORD(1)) & !(len2 & WORD(1)))) in fmpz_poly_resultant()
|
| H A D | compose_series.c | 20 _fmpz_poly_compose_series(fmpz * res, const fmpz * poly1, slong len1, in _fmpz_poly_compose_series() argument
23 if (len1 <= 10) in _fmpz_poly_compose_series()
24 _fmpz_poly_compose_series_horner(res, poly1, len1, poly2, len2, n); in _fmpz_poly_compose_series()
26 _fmpz_poly_compose_series_brent_kung(res, poly1, len1, poly2, len2, n); in _fmpz_poly_compose_series()
33 slong len1 = poly1->length; in fmpz_poly_compose_series() local
44 if (len1 == 0 || n == 0) in fmpz_poly_compose_series()
50 if (len2 == 0 || len1 == 1) in fmpz_poly_compose_series()
56 lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n); in fmpz_poly_compose_series()
57 len1 = FLINT_MIN(len1, lenr); in fmpz_poly_compose_series()
63 _fmpz_poly_compose_series(res->coeffs, poly1->coeffs, len1, in fmpz_poly_compose_series()
[all …]
|
| H A D | div_preinv.c | 21 slong len1 = len1_in; in _fmpz_poly_div_preinv() local
22 slong n = len1 - len2 + 1; in _fmpz_poly_div_preinv()
33 _fmpz_poly_divrem_preinv(Q + start, a + start, len1 - start, in _fmpz_poly_div_preinv()
36 len1 -= len2; in _fmpz_poly_div_preinv()
41 A_rev = _fmpz_vec_init(len1); in _fmpz_poly_div_preinv()
43 _fmpz_poly_reverse(A_rev, a, len1, len1); in _fmpz_poly_div_preinv()
44 _fmpz_poly_mullow(Q, A_rev, len1, B_inv, len2, n); in _fmpz_poly_div_preinv()
49 _fmpz_vec_clear(A_rev, len1); in _fmpz_poly_div_preinv()
58 slong len1 = A->length, len2 = B_inv->length; in fmpz_poly_div_preinv() local
59 slong qlen = len1 - len2 + 1; in fmpz_poly_div_preinv()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_poly/ |
| H A D | resultant.c | 18 void _fmpz_poly_resultant(fmpz_t res, const fmpz * poly1, slong len1, in _fmpz_poly_resultant() argument
21 slong bits1 = FLINT_ABS(_fmpz_vec_max_bits(poly1, len1)); in _fmpz_poly_resultant()
25 _fmpz_poly_resultant_modular(res, poly1, len1, poly2, len2); in _fmpz_poly_resultant()
27 _fmpz_poly_resultant_euclidean(res, poly1, len1, poly2, len2); in _fmpz_poly_resultant()
33 slong len1 = poly1->length; in fmpz_poly_resultant() local
36 if (len1 == 0 || len2 == 0) in fmpz_poly_resultant()
38 else if (len1 >= len2) in fmpz_poly_resultant()
39 _fmpz_poly_resultant(res, poly1->coeffs, len1, poly2->coeffs, len2); in fmpz_poly_resultant()
42 _fmpz_poly_resultant(res, poly2->coeffs, len2, poly1->coeffs, len1); in fmpz_poly_resultant()
43 if ((len1 > 1) && (!(len1 & WORD(1)) & !(len2 & WORD(1)))) in fmpz_poly_resultant()
|
| H A D | compose_series.c | 20 _fmpz_poly_compose_series(fmpz * res, const fmpz * poly1, slong len1, in _fmpz_poly_compose_series() argument
23 if (len1 <= 10) in _fmpz_poly_compose_series()
24 _fmpz_poly_compose_series_horner(res, poly1, len1, poly2, len2, n); in _fmpz_poly_compose_series()
26 _fmpz_poly_compose_series_brent_kung(res, poly1, len1, poly2, len2, n); in _fmpz_poly_compose_series()
33 slong len1 = poly1->length; in fmpz_poly_compose_series() local
44 if (len1 == 0 || n == 0) in fmpz_poly_compose_series()
50 if (len2 == 0 || len1 == 1) in fmpz_poly_compose_series()
56 lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n); in fmpz_poly_compose_series()
57 len1 = FLINT_MIN(len1, lenr); in fmpz_poly_compose_series()
63 _fmpz_poly_compose_series(res->coeffs, poly1->coeffs, len1, in fmpz_poly_compose_series()
[all …]
|
| H A D | div_preinv.c | 21 slong len1 = len1_in; in _fmpz_poly_div_preinv() local
22 slong n = len1 - len2 + 1; in _fmpz_poly_div_preinv()
33 _fmpz_poly_divrem_preinv(Q + start, a + start, len1 - start, in _fmpz_poly_div_preinv()
36 len1 -= len2; in _fmpz_poly_div_preinv()
41 A_rev = _fmpz_vec_init(len1); in _fmpz_poly_div_preinv()
43 _fmpz_poly_reverse(A_rev, a, len1, len1); in _fmpz_poly_div_preinv()
44 _fmpz_poly_mullow(Q, A_rev, len1, B_inv, len2, n); in _fmpz_poly_div_preinv()
49 _fmpz_vec_clear(A_rev, len1); in _fmpz_poly_div_preinv()
58 slong len1 = A->length, len2 = B_inv->length; in fmpz_poly_div_preinv() local
59 slong qlen = len1 - len2 + 1; in fmpz_poly_div_preinv()
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/jdk/java/io/ByteArrayOutputStream/ |
| H A D | Write.java | 108 size, off1, len1, off2, len2); in writeTest()
110 baos.write(b, off1, len1); in writeTest()
113 assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
119 assertEquals(Arrays.copyOfRange(b2, 0, len1), in writeTest()
120 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
122 assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2), in writeTest()
128 int len3 = len1 + len2 + b.length; in writeTest()
129 if (b3.length != len1 + len2 + b.length) { in writeTest()
133 assertEquals(Arrays.copyOfRange(b3, 0, len1), in writeTest()
134 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
[all …]
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/jdk/java/io/ByteArrayOutputStream/ |
| H A D | Write.java | 108 size, off1, len1, off2, len2); in writeTest()
110 baos.write(b, off1, len1); in writeTest()
113 assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
119 assertEquals(Arrays.copyOfRange(b2, 0, len1), in writeTest()
120 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
122 assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2), in writeTest()
128 int len3 = len1 + len2 + b.length; in writeTest()
129 if (b3.length != len1 + len2 + b.length) { in writeTest()
133 assertEquals(Arrays.copyOfRange(b3, 0, len1), in writeTest()
134 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
[all …]
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/jdk/java/io/ByteArrayOutputStream/ |
| H A D | Write.java | 108 size, off1, len1, off2, len2); in writeTest()
110 baos.write(b, off1, len1); in writeTest()
113 assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
119 assertEquals(Arrays.copyOfRange(b2, 0, len1), in writeTest()
120 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
122 assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2), in writeTest()
128 int len3 = len1 + len2 + b.length; in writeTest()
129 if (b3.length != len1 + len2 + b.length) { in writeTest()
133 assertEquals(Arrays.copyOfRange(b3, 0, len1), in writeTest()
134 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
[all …]
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/jdk/java/io/ByteArrayOutputStream/ |
| H A D | Write.java | 108 size, off1, len1, off2, len2); in writeTest()
110 baos.write(b, off1, len1); in writeTest()
113 assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
119 assertEquals(Arrays.copyOfRange(b2, 0, len1), in writeTest()
120 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
122 assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2), in writeTest()
128 int len3 = len1 + len2 + b.length; in writeTest()
129 if (b3.length != len1 + len2 + b.length) { in writeTest()
133 assertEquals(Arrays.copyOfRange(b3, 0, len1), in writeTest()
134 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
[all …]
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/java/io/ByteArrayOutputStream/ |
| H A D | Write.java | 108 size, off1, len1, off2, len2); in writeTest()
110 baos.write(b, off1, len1); in writeTest()
113 assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
119 assertEquals(Arrays.copyOfRange(b2, 0, len1), in writeTest()
120 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
122 assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2), in writeTest()
128 int len3 = len1 + len2 + b.length; in writeTest()
129 if (b3.length != len1 + len2 + b.length) { in writeTest()
133 assertEquals(Arrays.copyOfRange(b3, 0, len1), in writeTest()
134 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
[all …]
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/java/io/ByteArrayOutputStream/ |
| H A D | Write.java | 108 size, off1, len1, off2, len2); in writeTest()
110 baos.write(b, off1, len1); in writeTest()
113 assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
119 assertEquals(Arrays.copyOfRange(b2, 0, len1), in writeTest()
120 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
122 assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2), in writeTest()
128 int len3 = len1 + len2 + b.length; in writeTest()
129 if (b3.length != len1 + len2 + b.length) { in writeTest()
133 assertEquals(Arrays.copyOfRange(b3, 0, len1), in writeTest()
134 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
[all …]
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/io/ByteArrayOutputStream/ |
| H A D | Write.java | 108 size, off1, len1, off2, len2); in writeTest()
110 baos.write(b, off1, len1); in writeTest()
113 assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
119 assertEquals(Arrays.copyOfRange(b2, 0, len1), in writeTest()
120 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
122 assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2), in writeTest()
128 int len3 = len1 + len2 + b.length; in writeTest()
129 if (b3.length != len1 + len2 + b.length) { in writeTest()
133 assertEquals(Arrays.copyOfRange(b3, 0, len1), in writeTest()
134 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
[all …]
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/java/io/ByteArrayOutputStream/ |
| H A D | Write.java | 108 size, off1, len1, off2, len2); in writeTest()
110 baos.write(b, off1, len1); in writeTest()
113 assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
119 assertEquals(Arrays.copyOfRange(b2, 0, len1), in writeTest()
120 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
122 assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2), in writeTest()
128 int len3 = len1 + len2 + b.length; in writeTest()
129 if (b3.length != len1 + len2 + b.length) { in writeTest()
133 assertEquals(Arrays.copyOfRange(b3, 0, len1), in writeTest()
134 Arrays.copyOfRange(b, off1, off1 + len1), in writeTest()
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz_mod_poly/ |
| H A D | mul.c | 19 void _fmpz_mod_poly_mul(fmpz *res, const fmpz *poly1, slong len1, in _fmpz_mod_poly_mul() argument
22 _fmpz_poly_mul(res, poly1, len1, poly2, len2); in _fmpz_mod_poly_mul()
23 _fmpz_vec_scalar_mod_fmpz(res, res, len1 + len2 - 1, p); in _fmpz_mod_poly_mul()
29 const slong len1 = poly1->length; in fmpz_mod_poly_mul() local
31 const slong lenr = len1 + len2 - 1; in fmpz_mod_poly_mul()
33 if ((len1 == 0) || (len2 == 0)) in fmpz_mod_poly_mul()
43 if (len1 >= len2) in fmpz_mod_poly_mul()
44 _fmpz_mod_poly_mul(t, poly1->coeffs, len1, in fmpz_mod_poly_mul()
48 poly1->coeffs, len1, &(res->p)); in fmpz_mod_poly_mul()
59 if (len1 >= len2) in fmpz_mod_poly_mul()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_mod_poly/ |
| H A D | mul.c | 19 void _fmpz_mod_poly_mul(fmpz *res, const fmpz *poly1, slong len1, in _fmpz_mod_poly_mul() argument
22 _fmpz_poly_mul(res, poly1, len1, poly2, len2); in _fmpz_mod_poly_mul()
23 _fmpz_vec_scalar_mod_fmpz(res, res, len1 + len2 - 1, p); in _fmpz_mod_poly_mul()
29 const slong len1 = poly1->length; in fmpz_mod_poly_mul() local
31 const slong lenr = len1 + len2 - 1; in fmpz_mod_poly_mul()
33 if ((len1 == 0) || (len2 == 0)) in fmpz_mod_poly_mul()
43 if (len1 >= len2) in fmpz_mod_poly_mul()
44 _fmpz_mod_poly_mul(t, poly1->coeffs, len1, in fmpz_mod_poly_mul()
48 poly1->coeffs, len1, &(res->p)); in fmpz_mod_poly_mul()
59 if (len1 >= len2) in fmpz_mod_poly_mul()
[all …]
|