| /dports/security/seal/SEAL-3.7.2/native/tests/seal/util/ |
| H A D | polyarithsmallmod.cpp | 162 poly1[0] = 1; in TEST()
163 poly1[1] = 3; in TEST()
164 poly1[2] = 4; in TEST()
169 add_poly_coeffmod(poly1, poly2, 3, mod, poly1); in TEST()
192 add_poly_coeffmod(poly1, poly2, 2, mod, poly1); in TEST()
231 add_poly_coeffmod(poly1, poly2, 2, mod, poly1); in TEST()
254 poly1[0] = 4; in TEST()
255 poly1[1] = 3; in TEST()
261 sub_poly_coeffmod(poly1, poly2, 3, mod, poly1); in TEST()
284 sub_poly_coeffmod(poly1, poly2, 2, mod, poly1); in TEST()
[all …]
|
| /dports/math/flint2/flint-2.8.4/nmod_poly/ |
| H A D | mul_classical.c | 54 c = poly1[i]; in _nmod_poly_mul_classical()
67 mp_limb_t c = poly1[i]; in _nmod_poly_mul_classical()
98 c = _nmod_vec_dot_rev(poly1 + n1, poly1 + i - n2, n2 - n1 + 1, mod, nlimbs); in _nmod_poly_mul_classical()
102 NMOD_ADDMUL(c, poly1[i / 2], poly1[i / 2], mod); in _nmod_poly_mul_classical()
135 if (res == poly1 || res == poly2) in nmod_poly_mul_classical()
138 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, len_out); in nmod_poly_mul_classical()
139 if (poly1->length >= poly2->length) in nmod_poly_mul_classical()
146 poly1->length, poly1->mod); in nmod_poly_mul_classical()
153 if (poly1->length >= poly2->length) in nmod_poly_mul_classical()
154 _nmod_poly_mul_classical(res->coeffs, poly1->coeffs, poly1->length, in nmod_poly_mul_classical()
[all …]
|
| H A D | mullow_classical.c | 58 c = poly1[i]; in _nmod_poly_mullow_classical()
66 res[i + j] += poly1[j] * c; in _nmod_poly_mullow_classical()
73 mp_limb_t c = poly1[i]; in _nmod_poly_mullow_classical()
105 c = _nmod_vec_dot_rev(poly1 + n1, poly1 + i - n2, n2 - n1 + 1, mod, nlimbs); in _nmod_poly_mullow_classical()
109 NMOD_ADDMUL(c, poly1[i / 2], poly1[i / 2], mod); in _nmod_poly_mullow_classical()
145 if (res == poly1 || res == poly2) in nmod_poly_mullow_classical()
148 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, trunc); in nmod_poly_mullow_classical()
149 if (poly1->length >= poly2->length) in nmod_poly_mullow_classical()
156 poly1->length, trunc, poly1->mod); in nmod_poly_mullow_classical()
163 if (poly1->length >= poly2->length) in nmod_poly_mullow_classical()
[all …]
|
| H A D | mulhigh_classical.c | 21 _nmod_poly_mulhigh_classical(mp_ptr res, mp_srcptr poly1, in _nmod_poly_mulhigh_classical() argument
53 poly1[len1 - 1]); in _nmod_poly_mulhigh_classical()
61 poly1[i]); in _nmod_poly_mulhigh_classical()
88 poly1[i], mod); in _nmod_poly_mulhigh_classical()
99 slong len_out = poly1->length + poly2->length - 1; in nmod_poly_mulhigh_classical()
107 if (res == poly1 || res == poly2) in nmod_poly_mulhigh_classical()
110 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, len_out); in nmod_poly_mulhigh_classical()
111 if (poly1->length >= poly2->length) in nmod_poly_mulhigh_classical()
118 poly1->length, start, poly1->mod); in nmod_poly_mulhigh_classical()
125 if (poly1->length >= poly2->length) in nmod_poly_mulhigh_classical()
[all …]
|
| H A D | mul.c | 19 void _nmod_poly_mul(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_mul() argument
47 len1 = poly1->length; in nmod_poly_mul()
57 len_out = poly1->length + poly2->length - 1; in nmod_poly_mul()
59 if (res == poly1 || res == poly2) in nmod_poly_mul()
63 nmod_poly_init2(temp, poly1->mod.n, len_out); in nmod_poly_mul()
66 _nmod_poly_mul(temp->coeffs, poly1->coeffs, len1, in nmod_poly_mul()
67 poly2->coeffs, len2, poly1->mod); in nmod_poly_mul()
70 poly1->coeffs, len1, poly1->mod); in nmod_poly_mul()
79 _nmod_poly_mul(res->coeffs, poly1->coeffs, len1, in nmod_poly_mul()
80 poly2->coeffs, len2, poly1->mod); in nmod_poly_mul()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_poly/ |
| H A D | mul_classical.c | 20 _nmod_poly_mul_classical(mp_ptr res, mp_srcptr poly1, in _nmod_poly_mul_classical() argument
30 mpn_mul_1(res, poly1, len1, poly2[0]); in _nmod_poly_mul_classical()
54 poly1[len1 - 1], mod); in _nmod_poly_mul_classical()
75 len_out = poly1->length + poly2->length - 1; in nmod_poly_mul_classical()
77 if (res == poly1 || res == poly2) in nmod_poly_mul_classical()
80 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, len_out); in nmod_poly_mul_classical()
81 if (poly1->length >= poly2->length) in nmod_poly_mul_classical()
88 poly1->length, poly1->mod); in nmod_poly_mul_classical()
95 if (poly1->length >= poly2->length) in nmod_poly_mul_classical()
96 _nmod_poly_mul_classical(res->coeffs, poly1->coeffs, poly1->length, in nmod_poly_mul_classical()
[all …]
|
| H A D | mullow_classical.c | 45 poly1[len1 - 1]); in _nmod_poly_mullow_classical()
67 poly1[len1 - 1], mod); in _nmod_poly_mullow_classical()
73 poly1[i], mod); in _nmod_poly_mullow_classical()
85 if (poly1->length == 0 || poly2->length == 0 || trunc == 0) in nmod_poly_mullow_classical()
91 len_out = poly1->length + poly2->length - 1; in nmod_poly_mullow_classical()
95 if (res == poly1 || res == poly2) in nmod_poly_mullow_classical()
98 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, trunc); in nmod_poly_mullow_classical()
99 if (poly1->length >= poly2->length) in nmod_poly_mullow_classical()
106 poly1->length, trunc, poly1->mod); in nmod_poly_mullow_classical()
113 if (poly1->length >= poly2->length) in nmod_poly_mullow_classical()
[all …]
|
| H A D | mulhigh_classical.c | 21 _nmod_poly_mulhigh_classical(mp_ptr res, mp_srcptr poly1, in _nmod_poly_mulhigh_classical() argument
52 poly1[len1 - 1]); in _nmod_poly_mulhigh_classical()
60 poly1[i]); in _nmod_poly_mulhigh_classical()
87 poly1[i], mod); in _nmod_poly_mulhigh_classical()
98 slong len_out = poly1->length + poly2->length - 1; in nmod_poly_mulhigh_classical()
106 if (res == poly1 || res == poly2) in nmod_poly_mulhigh_classical()
109 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, len_out); in nmod_poly_mulhigh_classical()
110 if (poly1->length >= poly2->length) in nmod_poly_mulhigh_classical()
117 poly1->length, start, poly1->mod); in nmod_poly_mulhigh_classical()
124 if (poly1->length >= poly2->length) in nmod_poly_mulhigh_classical()
[all …]
|
| H A D | mul.c | 18 void _nmod_poly_mul(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_mul() argument
46 len1 = poly1->length; in nmod_poly_mul()
56 len_out = poly1->length + poly2->length - 1; in nmod_poly_mul()
58 if (res == poly1 || res == poly2) in nmod_poly_mul()
62 nmod_poly_init2(temp, poly1->mod.n, len_out); in nmod_poly_mul()
65 _nmod_poly_mul(temp->coeffs, poly1->coeffs, len1, in nmod_poly_mul()
66 poly2->coeffs, len2, poly1->mod); in nmod_poly_mul()
69 poly1->coeffs, len1, poly1->mod); in nmod_poly_mul()
78 _nmod_poly_mul(res->coeffs, poly1->coeffs, len1, in nmod_poly_mul()
79 poly2->coeffs, len2, poly1->mod); in nmod_poly_mul()
[all …]
|
| H A D | mul_KS.c | 80 if (res == poly1 || res == poly2) in nmod_poly_mul_KS()
83 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, len_out); in nmod_poly_mul_KS()
84 if (poly1->length >= poly2->length) in nmod_poly_mul_KS()
85 _nmod_poly_mul_KS(temp->coeffs, poly1->coeffs, poly1->length, in nmod_poly_mul_KS()
87 poly1->mod); in nmod_poly_mul_KS()
90 poly1->coeffs, poly1->length, bits, in nmod_poly_mul_KS()
91 poly1->mod); in nmod_poly_mul_KS()
99 _nmod_poly_mul_KS(res->coeffs, poly1->coeffs, poly1->length, in nmod_poly_mul_KS()
101 poly1->mod); in nmod_poly_mul_KS()
104 poly1->coeffs, poly1->length, bits, in nmod_poly_mul_KS()
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/nmod_poly/ |
| H A D | mul_classical.c | 20 _nmod_poly_mul_classical(mp_ptr res, mp_srcptr poly1, in _nmod_poly_mul_classical() argument
30 mpn_mul_1(res, poly1, len1, poly2[0]); in _nmod_poly_mul_classical()
54 poly1[len1 - 1], mod); in _nmod_poly_mul_classical()
75 len_out = poly1->length + poly2->length - 1; in nmod_poly_mul_classical()
77 if (res == poly1 || res == poly2) in nmod_poly_mul_classical()
80 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, len_out); in nmod_poly_mul_classical()
81 if (poly1->length >= poly2->length) in nmod_poly_mul_classical()
88 poly1->length, poly1->mod); in nmod_poly_mul_classical()
95 if (poly1->length >= poly2->length) in nmod_poly_mul_classical()
96 _nmod_poly_mul_classical(res->coeffs, poly1->coeffs, poly1->length, in nmod_poly_mul_classical()
[all …]
|
| H A D | mullow_classical.c | 45 poly1[len1 - 1]); in _nmod_poly_mullow_classical()
67 poly1[len1 - 1], mod); in _nmod_poly_mullow_classical()
73 poly1[i], mod); in _nmod_poly_mullow_classical()
85 if (poly1->length == 0 || poly2->length == 0 || trunc == 0) in nmod_poly_mullow_classical()
91 len_out = poly1->length + poly2->length - 1; in nmod_poly_mullow_classical()
95 if (res == poly1 || res == poly2) in nmod_poly_mullow_classical()
98 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, trunc); in nmod_poly_mullow_classical()
99 if (poly1->length >= poly2->length) in nmod_poly_mullow_classical()
106 poly1->length, trunc, poly1->mod); in nmod_poly_mullow_classical()
113 if (poly1->length >= poly2->length) in nmod_poly_mullow_classical()
[all …]
|
| H A D | mulhigh_classical.c | 21 _nmod_poly_mulhigh_classical(mp_ptr res, mp_srcptr poly1, in _nmod_poly_mulhigh_classical() argument
52 poly1[len1 - 1]); in _nmod_poly_mulhigh_classical()
60 poly1[i]); in _nmod_poly_mulhigh_classical()
87 poly1[i], mod); in _nmod_poly_mulhigh_classical()
98 slong len_out = poly1->length + poly2->length - 1; in nmod_poly_mulhigh_classical()
106 if (res == poly1 || res == poly2) in nmod_poly_mulhigh_classical()
109 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, len_out); in nmod_poly_mulhigh_classical()
110 if (poly1->length >= poly2->length) in nmod_poly_mulhigh_classical()
117 poly1->length, start, poly1->mod); in nmod_poly_mulhigh_classical()
124 if (poly1->length >= poly2->length) in nmod_poly_mulhigh_classical()
[all …]
|
| H A D | mul.c | 18 void _nmod_poly_mul(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_mul() argument
46 len1 = poly1->length; in nmod_poly_mul()
56 len_out = poly1->length + poly2->length - 1; in nmod_poly_mul()
58 if (res == poly1 || res == poly2) in nmod_poly_mul()
62 nmod_poly_init2(temp, poly1->mod.n, len_out); in nmod_poly_mul()
65 _nmod_poly_mul(temp->coeffs, poly1->coeffs, len1, in nmod_poly_mul()
66 poly2->coeffs, len2, poly1->mod); in nmod_poly_mul()
69 poly1->coeffs, len1, poly1->mod); in nmod_poly_mul()
78 _nmod_poly_mul(res->coeffs, poly1->coeffs, len1, in nmod_poly_mul()
79 poly2->coeffs, len2, poly1->mod); in nmod_poly_mul()
[all …]
|
| H A D | mul_KS.c | 80 if (res == poly1 || res == poly2) in nmod_poly_mul_KS()
83 nmod_poly_init2_preinv(temp, poly1->mod.n, poly1->mod.ninv, len_out); in nmod_poly_mul_KS()
84 if (poly1->length >= poly2->length) in nmod_poly_mul_KS()
85 _nmod_poly_mul_KS(temp->coeffs, poly1->coeffs, poly1->length, in nmod_poly_mul_KS()
87 poly1->mod); in nmod_poly_mul_KS()
90 poly1->coeffs, poly1->length, bits, in nmod_poly_mul_KS()
91 poly1->mod); in nmod_poly_mul_KS()
99 _nmod_poly_mul_KS(res->coeffs, poly1->coeffs, poly1->length, in nmod_poly_mul_KS()
101 poly1->mod); in nmod_poly_mul_KS()
104 poly1->coeffs, poly1->length, bits, in nmod_poly_mul_KS()
[all …]
|
| /dports/math/arb/arb-2.21.1/arb_poly/ |
| H A D | mullow_classical.c | 18 arb_srcptr poly1, slong len1, in _arb_poly_mullow_classical() argument
26 arb_mul(res, poly1, poly2, prec); in _arb_poly_mullow_classical()
28 else if (poly1 == poly2 && len1 == len2) in _arb_poly_mullow_classical()
32 arb_sqr(res, poly1, prec); in _arb_poly_mullow_classical()
33 arb_mul(res + 1, poly1, poly1 + 1, prec); in _arb_poly_mullow_classical()
45 arb_addmul(res + i, poly1 + i / 2, poly1 + i / 2, prec); in _arb_poly_mullow_classical()
50 arb_mul(res + 2 * len1 - 3, poly1 + len1 - 1, poly1 + len1 - 2, prec); in _arb_poly_mullow_classical()
69 arb_mul(res, poly1, poly2, prec); in _arb_poly_mullow_classical()
99 if (res == poly1 || res == poly2) in arb_poly_mullow_classical()
103 _arb_poly_mullow_classical(t->coeffs, poly1->coeffs, poly1->length, in arb_poly_mullow_classical()
[all …]
|
| H A D | mullow.c | 16 arb_srcptr poly1, slong len1, in _arb_poly_mullow() argument
21 arb_mul(res, poly1, poly2, prec); in _arb_poly_mullow()
42 if (poly1 == poly2 && prec >= 256) in _arb_poly_mullow()
44 if (poly1 == poly2 && prec >= 4096) in _arb_poly_mullow()
57 arb_poly_mullow(arb_poly_t res, const arb_poly_t poly1, in arb_poly_mullow() argument
62 len1 = poly1->length; in arb_poly_mullow()
98 if (res == poly1 || res == poly2) in arb_poly_mullow()
102 arb_mul(t, poly1->coeffs, poly2->coeffs + 1, prec); in arb_poly_mullow()
121 if (res == poly1 || res == poly2) in arb_poly_mullow()
125 _arb_poly_mullow(t->coeffs, poly1->coeffs, len1, in arb_poly_mullow()
[all …]
|
| /dports/math/arb/arb-2.21.1/acb_poly/ |
| H A D | mullow_classical.c | 17 acb_srcptr poly1, slong len1, in _acb_poly_mullow_classical() argument
25 acb_mul(res, poly1, poly2, prec); in _acb_poly_mullow_classical()
27 else if (poly1 == poly2 && len1 == len2) in _acb_poly_mullow_classical()
31 acb_sqr(res, poly1, prec); in _acb_poly_mullow_classical()
32 acb_mul(res + 1, poly1, poly1 + 1, prec); in _acb_poly_mullow_classical()
44 acb_addmul(res + i, poly1 + i / 2, poly1 + i / 2, prec); in _acb_poly_mullow_classical()
49 acb_mul(res + 2 * len1 - 3, poly1 + len1 - 1, poly1 + len1 - 2, prec); in _acb_poly_mullow_classical()
68 acb_mul(res, poly1, poly2, prec); in _acb_poly_mullow_classical()
98 if (res == poly1 || res == poly2) in acb_poly_mullow_classical()
102 _acb_poly_mullow_classical(t->coeffs, poly1->coeffs, poly1->length, in acb_poly_mullow_classical()
[all …]
|
| H A D | mullow.c | 16 acb_srcptr poly1, slong len1, in _acb_poly_mullow() argument
21 acb_mul(res, poly1, poly2, prec); in _acb_poly_mullow()
42 if (poly1 == poly2 && prec >= 256) in _acb_poly_mullow()
44 if (poly1 == poly2 && prec >= 4096) in _acb_poly_mullow()
57 acb_poly_mullow(acb_poly_t res, const acb_poly_t poly1, in acb_poly_mullow() argument
62 len1 = poly1->length; in acb_poly_mullow()
96 if (res == poly1 || res == poly2) in acb_poly_mullow()
100 acb_mul(t, poly1->coeffs, poly2->coeffs + 1, prec); in acb_poly_mullow()
119 if (res == poly1 || res == poly2) in acb_poly_mullow()
123 _acb_poly_mullow(t->coeffs, poly1->coeffs, len1, in acb_poly_mullow()
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/fmpq_poly/ |
| H A D | inv.c | 26 if (poly1 == poly2) in fmpq_poly_inv()
28 fmpz_swap(poly1->coeffs, poly1->den); in fmpq_poly_inv()
29 if (fmpz_sgn(poly1->den) < 0) in fmpq_poly_inv()
31 fmpz_neg(poly1->coeffs, poly1->coeffs); in fmpq_poly_inv()
32 fmpz_neg(poly1->den, poly1->den); in fmpq_poly_inv()
37 fmpq_poly_fit_length(poly1, 1); in fmpq_poly_inv()
40 fmpz_set(poly1->coeffs, poly2->den); in fmpq_poly_inv()
41 fmpz_set(poly1->den, poly2->coeffs); in fmpq_poly_inv()
45 fmpz_neg(poly1->coeffs, poly2->den); in fmpq_poly_inv()
46 fmpz_neg(poly1->den, poly2->coeffs); in fmpq_poly_inv()
[all …]
|
| /dports/math/flint2/flint-2.8.4/fmpq_poly/ |
| H A D | inv.c | 26 if (poly1 == poly2) in fmpq_poly_inv()
28 fmpz_swap(poly1->coeffs, poly1->den); in fmpq_poly_inv()
29 if (fmpz_sgn(poly1->den) < 0) in fmpq_poly_inv()
31 fmpz_neg(poly1->coeffs, poly1->coeffs); in fmpq_poly_inv()
32 fmpz_neg(poly1->den, poly1->den); in fmpq_poly_inv()
37 fmpq_poly_fit_length(poly1, 1); in fmpq_poly_inv()
40 fmpz_set(poly1->coeffs, poly2->den); in fmpq_poly_inv()
41 fmpz_set(poly1->den, poly2->coeffs); in fmpq_poly_inv()
45 fmpz_neg(poly1->coeffs, poly2->den); in fmpq_poly_inv()
46 fmpz_neg(poly1->den, poly2->coeffs); in fmpq_poly_inv()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpq_poly/ |
| H A D | inv.c | 26 if (poly1 == poly2) in fmpq_poly_inv()
28 fmpz_swap(poly1->coeffs, poly1->den); in fmpq_poly_inv()
29 if (fmpz_sgn(poly1->den) < 0) in fmpq_poly_inv()
31 fmpz_neg(poly1->coeffs, poly1->coeffs); in fmpq_poly_inv()
32 fmpz_neg(poly1->den, poly1->den); in fmpq_poly_inv()
37 fmpq_poly_fit_length(poly1, 1); in fmpq_poly_inv()
40 fmpz_set(poly1->coeffs, poly2->den); in fmpq_poly_inv()
41 fmpz_set(poly1->den, poly2->coeffs); in fmpq_poly_inv()
45 fmpz_neg(poly1->coeffs, poly2->den); in fmpq_poly_inv()
46 fmpz_neg(poly1->den, poly2->coeffs); in fmpq_poly_inv()
[all …]
|
| /dports/math/symengine/symengine-0.8.1/symengine/tests/polynomial/ |
| H A D | test_basic_conversions.cpp | 189 REQUIRE(eq(*poly1, *poly2));
196 REQUIRE(eq(*poly1, *poly2));
203 REQUIRE(eq(*poly1, *poly2));
210 REQUIRE(eq(*poly1, *poly2));
217 REQUIRE(eq(*poly1, *poly2));
226 REQUIRE(eq(*poly1, *poly2));
233 REQUIRE(eq(*poly1, *poly2));
240 REQUIRE(eq(*poly1, *poly2));
247 REQUIRE(eq(*poly1, *poly2));
250 REQUIRE(eq(*poly1, *poly2));
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz_mod_poly_factor/test/ |
| H A D | t-is_irreducible_ddf.c | 33 fmpz_mod_poly_t poly1, poly2; in main() local
40 fmpz_mod_poly_init(poly1, modulus); in main()
46 fmpz_mod_poly_randtest(poly1, state, length); in main()
47 if (!fmpz_mod_poly_is_zero(poly1)) in main()
48 fmpz_mod_poly_make_monic(poly1, poly1); in main()
50 while ((!fmpz_mod_poly_is_irreducible_ddf(poly1)) || (poly1->length < 2)); in main()
59 if (!fmpz_mod_poly_is_zero(poly1)) in main()
64 fmpz_mod_poly_mul(poly1, poly1, poly2); in main()
67 if (fmpz_mod_poly_is_irreducible_ddf(poly1)) in main()
71 fmpz_mod_poly_print(poly1); in main()
[all …]
|
| H A D | t-is_irreducible.c | 33 fmpz_mod_poly_t poly1, poly2; in main() local
40 fmpz_mod_poly_init(poly1, modulus); in main()
46 fmpz_mod_poly_randtest(poly1, state, length); in main()
47 if (!fmpz_mod_poly_is_zero(poly1)) in main()
48 fmpz_mod_poly_make_monic(poly1, poly1); in main()
50 while ((!fmpz_mod_poly_is_irreducible(poly1)) || (poly1->length < 2)); in main()
59 if (!fmpz_mod_poly_is_zero(poly1)) in main()
64 fmpz_mod_poly_mul(poly1, poly1, poly2); in main()
67 if (fmpz_mod_poly_is_irreducible(poly1)) in main()
71 fmpz_mod_poly_print(poly1); in main()
[all …]
|