Home
last modified time | relevance | path

Searched refs:len1 (Results 126 – 150 of 8554) sorted by relevance

12345678910>>...343

/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpq_poly/
H A Dadd_series.c27 if (n < len1) in _fmpq_poly_add_series_can()
29 len1 = n; in _fmpq_poly_add_series_can()
39 max = FLINT_MAX(len1, len2); in _fmpq_poly_add_series_can()
40 min = FLINT_MIN(len1, len2); in _fmpq_poly_add_series_can()
79 if (len1 < len2) in _fmpq_poly_add_series_can()
113 if (len1 < len2) in _fmpq_poly_add_series_can()
181 len1 = FLINT_MIN(len1, n); in fmpq_poly_add_series_can()
183 fmpq_poly_fit_length(res, len1); in fmpq_poly_add_series_can()
184 _fmpq_poly_set_length(res, len1); in fmpq_poly_add_series_can()
198 if (len1 < poly1->length) in fmpq_poly_add_series_can()
[all …]
H A Dresultant_modular_div.c35 if (len1 == 1) in _fmpq_poly_resultant_div()
40 else if (len1 == 2) in _fmpq_poly_resultant_div()
47 fmpz_pow_ui(rnum, poly2, len1 - 1); in _fmpq_poly_resultant_div()
54 fmpz_pow_ui(rden, den2, len1 - 1); in _fmpq_poly_resultant_div()
67 _fmpz_vec_content(c1, poly1, len1); in _fmpq_poly_resultant_div()
70 prim1 = _fmpz_vec_init(len1); in _fmpq_poly_resultant_div()
93 fmpz_pow_ui(lb, c2, len1 - 1); in _fmpq_poly_resultant_div()
119 fmpz_pow_ui(rden, den2, len1 - 1); in _fmpq_poly_resultant_div()
139 _fmpz_vec_clear(prim1, len1); in _fmpq_poly_resultant_div()
146 const slong len1 = f->length; in fmpq_poly_resultant_div() local
[all …]
/dports/math/flint2/flint-2.8.4/nmod_poly/
H A Dmullow.c19 void _nmod_poly_mullow(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_mullow() argument
24 len1 = FLINT_MIN(len1, n); in _nmod_poly_mullow()
44 slong len1, len2, len_out; in nmod_poly_mullow() local
46 len1 = poly1->length; in nmod_poly_mullow()
53 if (len1 == 0 || len2 == 0 || trunc == 0) in nmod_poly_mullow()
66 if (len1 >= len2) in nmod_poly_mullow()
67 _nmod_poly_mullow(temp->coeffs, poly1->coeffs, len1, in nmod_poly_mullow()
71 poly1->coeffs, len1, trunc, poly1->mod); in nmod_poly_mullow()
79 if (len1 >= len2) in nmod_poly_mullow()
80 _nmod_poly_mullow(res->coeffs, poly1->coeffs, len1, in nmod_poly_mullow()
[all …]
H A Dmul_classical.c28 if (len1 == 1) in _nmod_poly_mul_classical()
48 flint_mpn_zero(res, len1 + len2 - 1); in _nmod_poly_mul_classical()
52 for (i = 0; i < len1; i++) in _nmod_poly_mul_classical()
59 for (j = i + 1; j < len1; j++) in _nmod_poly_mul_classical()
65 for (i = 0; i < len1; i++) in _nmod_poly_mul_classical()
82 res[len1 + len2 - 2] = nmod_mul(poly1[len1 - 1], poly2[len2 - 1], mod); in _nmod_poly_mul_classical()
93 for (i = 0; i < 2 * len1 - 1; i++) in _nmod_poly_mul_classical()
95 n1 = FLINT_MAX(0, i - len1 + 1); in _nmod_poly_mul_classical()
101 if (i % 2 == 0 && i / 2 < len1) in _nmod_poly_mul_classical()
109 for (i = 0; i < len1 + len2 - 1; i++) in _nmod_poly_mul_classical()
[all …]
H A Dcompose_divconquer.c85 if (len1 == 1) in _nmod_poly_compose_divconquer()
95 if (len1 == 2) in _nmod_poly_compose_divconquer()
105 for (k = 1; (2 << k) < len1; k++) ; in _nmod_poly_compose_divconquer()
117 for (i = 0; i < (len1 + 1) / 2; i++) in _nmod_poly_compose_divconquer()
123 for (i = 0; i < (len1 - 1) / 2; i++) in _nmod_poly_compose_divconquer()
128 hlen[(len1 - 1) / 2] = 0; in _nmod_poly_compose_divconquer()
134 for (i = 0, j = 0; i < len1 / 2; i++, j += 2) in _nmod_poly_compose_divconquer()
148 if ((len1 & WORD(1))) in _nmod_poly_compose_divconquer()
208 const slong len1 = poly1->length; in nmod_poly_compose_divconquer() local
211 if (len1 == 0) in nmod_poly_compose_divconquer()
[all …]
H A Dmulhigh_classical.c43 if (start < len1) in _nmod_poly_mulhigh_classical()
49 m = FLINT_MAX(len1 - 1, start); in _nmod_poly_mulhigh_classical()
51 FLINT_ASSERT(len2 - 1 + len1 - m > 0); in _nmod_poly_mulhigh_classical()
52 mpn_mul_1(res + m, poly2 + m - len1 + 1, len2 - 1 + len1 - m, in _nmod_poly_mulhigh_classical()
53 poly1[len1 - 1]); in _nmod_poly_mulhigh_classical()
57 for (i = m - len2 + 1; i < len1 - 1; i++) in _nmod_poly_mulhigh_classical()
65 _nmod_vec_reduce(res, res, len1 + len2 - 1, mod); in _nmod_poly_mulhigh_classical()
70 if (start < len1) in _nmod_poly_mulhigh_classical()
78 m = FLINT_MAX(len1 - 1, start); in _nmod_poly_mulhigh_classical()
80 len2 - 1 + len1 - m, poly1[len1 - 1], mod); in _nmod_poly_mulhigh_classical()
[all …]
/dports/math/cln/cln-1.3.6/src/base/digitseq/
H A Dcl_DS_mul.cc25 void cl_UDS_mul (const uintD* sourceptr1, uintC len1,
42 dotimespC(len1,len1-1, in mulu_2loop()
358 { if (len1 >= cl_fftm_threshold) in cl_fftm_suitable()
360 if (len1 > cl_fftm_threshold1) in cl_fftm_suitable()
463 if (len1>len2) in cl_UDS_mul()
468 temp = len1; len1 = len2; len2 = temp; in cl_UDS_mul()
470 if (len1==1) in cl_UDS_mul()
478 if (len1 < cl_karatsuba_threshold) in cl_UDS_mul()
482 if (!cl_fftm_suitable(len1,len2)) in cl_UDS_mul()
497 mulu_xxx(sourceptr1,len1,sourceptr2,len2,arrayLSDptr(tmpprod_xxx,len1+len2)); in cl_UDS_mul()
[all …]
/dports/math/e-antic/flint2-ae7ec89/fmpq_poly/
H A Dresultant_modular_div.c35 if (len1 == 1) in _fmpq_poly_resultant_div()
40 else if (len1 == 2) in _fmpq_poly_resultant_div()
47 fmpz_pow_ui(rnum, poly2, len1 - 1); in _fmpq_poly_resultant_div()
54 fmpz_pow_ui(rden, den2, len1 - 1); in _fmpq_poly_resultant_div()
67 _fmpz_vec_content(c1, poly1, len1); in _fmpq_poly_resultant_div()
70 prim1 = _fmpz_vec_init(len1); in _fmpq_poly_resultant_div()
93 fmpz_pow_ui(lb, c2, len1 - 1); in _fmpq_poly_resultant_div()
119 fmpz_pow_ui(rden, den2, len1 - 1); in _fmpq_poly_resultant_div()
139 _fmpz_vec_clear(prim1, len1); in _fmpq_poly_resultant_div()
146 const slong len1 = f->length; in fmpq_poly_resultant_div() local
[all …]
/dports/math/flint2/flint-2.8.4/fmpq_poly/
H A Dresultant_modular_div.c35 if (len1 == 1) in _fmpq_poly_resultant_div()
40 else if (len1 == 2) in _fmpq_poly_resultant_div()
47 fmpz_pow_ui(rnum, poly2, len1 - 1); in _fmpq_poly_resultant_div()
54 fmpz_pow_ui(rden, den2, len1 - 1); in _fmpq_poly_resultant_div()
67 _fmpz_vec_content(c1, poly1, len1); in _fmpq_poly_resultant_div()
70 prim1 = _fmpz_vec_init(len1); in _fmpq_poly_resultant_div()
93 fmpz_pow_ui(lb, c2, len1 - 1); in _fmpq_poly_resultant_div()
119 fmpz_pow_ui(rden, den2, len1 - 1); in _fmpq_poly_resultant_div()
139 _fmpz_vec_clear(prim1, len1); in _fmpq_poly_resultant_div()
146 const slong len1 = f->length; in fmpq_poly_resultant_div() local
[all …]
/dports/math/e-antic/flint2-ae7ec89/fmpz_mod_poly/
H A Dresultant_euclidean.c30 if (len1 == 1) in _fmpz_mod_poly_resultant_euclidean()
34 else if (len1 == 2) in _fmpz_mod_poly_resultant_euclidean()
54 w = _fmpz_vec_init(3 * len1); in _fmpz_mod_poly_resultant_euclidean()
56 v = w + len1; in _fmpz_mod_poly_resultant_euclidean()
57 r = v + len1; in _fmpz_mod_poly_resultant_euclidean()
59 _fmpz_vec_set(u, poly1, len1); in _fmpz_mod_poly_resultant_euclidean()
61 l1 = len1; in _fmpz_mod_poly_resultant_euclidean()
108 _fmpz_vec_clear(w, 3 * len1); in _fmpz_mod_poly_resultant_euclidean()
118 const slong len1 = f->length; in fmpz_mod_poly_resultant_euclidean() local
121 if (len1 == 0 || len2 == 0) in fmpz_mod_poly_resultant_euclidean()
[all …]
/dports/math/flint2/flint-2.8.4/fmpz_mod_poly/
H A Dresultant_euclidean.c30 if (len1 == 1) in _fmpz_mod_poly_resultant_euclidean()
34 else if (len1 == 2) in _fmpz_mod_poly_resultant_euclidean()
56 FMPZ_VEC_TMP_INIT(w, 3*len1); in _fmpz_mod_poly_resultant_euclidean()
58 v = w + len1; in _fmpz_mod_poly_resultant_euclidean()
59 r = v + len1; in _fmpz_mod_poly_resultant_euclidean()
61 _fmpz_vec_set(u, poly1, len1); in _fmpz_mod_poly_resultant_euclidean()
63 l1 = len1; in _fmpz_mod_poly_resultant_euclidean()
110 FMPZ_VEC_TMP_CLEAR(w, 3*len1); in _fmpz_mod_poly_resultant_euclidean()
122 const slong len1 = f->length; in fmpz_mod_poly_resultant_euclidean() local
125 if (len1 == 0 || len2 == 0) in fmpz_mod_poly_resultant_euclidean()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_mod_poly/
H A Dresultant_euclidean.c30 if (len1 == 1) in _fmpz_mod_poly_resultant_euclidean()
34 else if (len1 == 2) in _fmpz_mod_poly_resultant_euclidean()
54 w = _fmpz_vec_init(3 * len1); in _fmpz_mod_poly_resultant_euclidean()
56 v = w + len1; in _fmpz_mod_poly_resultant_euclidean()
57 r = v + len1; in _fmpz_mod_poly_resultant_euclidean()
59 _fmpz_vec_set(u, poly1, len1); in _fmpz_mod_poly_resultant_euclidean()
61 l1 = len1; in _fmpz_mod_poly_resultant_euclidean()
108 _fmpz_vec_clear(w, 3 * len1); in _fmpz_mod_poly_resultant_euclidean()
118 const slong len1 = f->length; in fmpz_mod_poly_resultant_euclidean() local
121 if (len1 == 0 || len2 == 0) in fmpz_mod_poly_resultant_euclidean()
[all …]
/dports/devel/spark/spark-2.1.1/core/src/main/java/org/apache/spark/util/collection/
H A DTimSort.java510 len1 -= k; in mergeAt()
511 if (len1 == 0) in mergeAt()
524 if (len1 <= len2) in mergeAt()
695 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
712 if (len1 == 1) {
789 if (len1 == 1) {
798 assert len1 > 1;
815 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
836 dest -= len1;
878 count1 = len1 - gallopRight(s.getKey(tmp, cursor2, key0), a, base1, len1, len1 - 1, c);
[all …]
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/util/
H A Dtimsort.hpp293 len1 -= k; in mergeAt()
295 if (len1 == 0) { in mergeAt()
403 assert(len1 > 0 && len2 > 0 && base1 + len1 == base2); in mergeLo()
416 if (len1 == 1) { in mergeLo()
507 if (len1 == 1) { in mergeLo()
520 assert(len1 > 0 && len2 > 0 && base1 + len1 == base2); in mergeHi()
534 dest -= len1; in mergeHi()
536 GFX_TIMSORT_MOVE_BACKWARD(cursor1, cursor1 + len1, dest + len1); in mergeHi()
577 count1 = len1 - gallopRight(*(cursor2-1), base1, len1, len1 - 1); in mergeHi()
628 dest -= len1; in mergeHi()
[all …]
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/include/util/
H A Dtimsort.hpp293 len1 -= k; in mergeAt()
295 if (len1 == 0) { in mergeAt()
403 assert(len1 > 0 && len2 > 0 && base1 + len1 == base2); in mergeLo()
416 if (len1 == 1) { in mergeLo()
507 if (len1 == 1) { in mergeLo()
520 assert(len1 > 0 && len2 > 0 && base1 + len1 == base2); in mergeHi()
534 dest -= len1; in mergeHi()
536 GFX_TIMSORT_MOVE_BACKWARD(cursor1, cursor1 + len1, dest + len1); in mergeHi()
577 count1 = len1 - gallopRight(*(cursor2-1), base1, len1, len1 - 1); in mergeHi()
628 dest -= len1; in mergeHi()
[all …]
/dports/math/e-antic/flint2-ae7ec89/fmpz_poly/
H A Dcompose_divconquer.c85 if (len1 <= 2 || len2 <= 1) in _fmpz_poly_compose_divconquer()
87 if (len1 == 1) in _fmpz_poly_compose_divconquer()
100 k = FLINT_CLOG2(len1) - 1; in _fmpz_poly_compose_divconquer()
112 for (i = 0; i < (len1 + 1) / 2; i++) in _fmpz_poly_compose_divconquer()
118 for (i = 0; i < (len1 - 1) / 2; i++) in _fmpz_poly_compose_divconquer()
123 hlen[(len1 - 1) / 2] = 0; in _fmpz_poly_compose_divconquer()
143 if ((len1 & WORD(1))) in _fmpz_poly_compose_divconquer()
203 const slong len1 = poly1->length; in fmpz_poly_compose_divconquer() local
207 if (len1 == 0) in fmpz_poly_compose_divconquer()
212 if (len1 == 1 || len2 == 0) in fmpz_poly_compose_divconquer()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_poly/
H A Dcompose_divconquer.c85 if (len1 == 1) in _nmod_poly_compose_divconquer()
95 if (len1 == 2) in _nmod_poly_compose_divconquer()
105 for (k = 1; (2 << k) < len1; k++) ; in _nmod_poly_compose_divconquer()
117 for (i = 0; i < (len1 + 1) / 2; i++) in _nmod_poly_compose_divconquer()
123 for (i = 0; i < (len1 - 1) / 2; i++) in _nmod_poly_compose_divconquer()
128 hlen[(len1 - 1) / 2] = 0; in _nmod_poly_compose_divconquer()
134 for (i = 0, j = 0; i < len1 / 2; i++, j += 2) in _nmod_poly_compose_divconquer()
148 if ((len1 & WORD(1))) in _nmod_poly_compose_divconquer()
208 const slong len1 = poly1->length; in nmod_poly_compose_divconquer() local
211 if (len1 == 0) in nmod_poly_compose_divconquer()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_poly/
H A Dcompose_divconquer.c85 if (len1 <= 2 || len2 <= 1) in _fmpz_poly_compose_divconquer()
87 if (len1 == 1) in _fmpz_poly_compose_divconquer()
100 k = FLINT_CLOG2(len1) - 1; in _fmpz_poly_compose_divconquer()
112 for (i = 0; i < (len1 + 1) / 2; i++) in _fmpz_poly_compose_divconquer()
118 for (i = 0; i < (len1 - 1) / 2; i++) in _fmpz_poly_compose_divconquer()
123 hlen[(len1 - 1) / 2] = 0; in _fmpz_poly_compose_divconquer()
143 if ((len1 & WORD(1))) in _fmpz_poly_compose_divconquer()
203 const slong len1 = poly1->length; in fmpz_poly_compose_divconquer() local
207 if (len1 == 0) in fmpz_poly_compose_divconquer()
212 if (len1 == 1 || len2 == 0) in fmpz_poly_compose_divconquer()
[all …]
/dports/math/e-antic/flint2-ae7ec89/nmod_poly/
H A Dcompose_divconquer.c85 if (len1 == 1) in _nmod_poly_compose_divconquer()
95 if (len1 == 2) in _nmod_poly_compose_divconquer()
105 for (k = 1; (2 << k) < len1; k++) ; in _nmod_poly_compose_divconquer()
117 for (i = 0; i < (len1 + 1) / 2; i++) in _nmod_poly_compose_divconquer()
123 for (i = 0; i < (len1 - 1) / 2; i++) in _nmod_poly_compose_divconquer()
128 hlen[(len1 - 1) / 2] = 0; in _nmod_poly_compose_divconquer()
134 for (i = 0, j = 0; i < len1 / 2; i++, j += 2) in _nmod_poly_compose_divconquer()
148 if ((len1 & WORD(1))) in _nmod_poly_compose_divconquer()
208 const slong len1 = poly1->length; in nmod_poly_compose_divconquer() local
211 if (len1 == 0) in nmod_poly_compose_divconquer()
[all …]
/dports/math/flint2/flint-2.8.4/fmpz_poly/
H A Dcompose_divconquer.c85 if (len1 <= 2 || len2 <= 1) in _fmpz_poly_compose_divconquer()
87 if (len1 == 1) in _fmpz_poly_compose_divconquer()
100 k = FLINT_CLOG2(len1) - 1; in _fmpz_poly_compose_divconquer()
112 for (i = 0; i < (len1 + 1) / 2; i++) in _fmpz_poly_compose_divconquer()
118 for (i = 0; i < (len1 - 1) / 2; i++) in _fmpz_poly_compose_divconquer()
123 hlen[(len1 - 1) / 2] = 0; in _fmpz_poly_compose_divconquer()
143 if ((len1 & WORD(1))) in _fmpz_poly_compose_divconquer()
203 const slong len1 = poly1->length; in fmpz_poly_compose_divconquer() local
207 if (len1 == 0) in fmpz_poly_compose_divconquer()
212 if (len1 == 1 || len2 == 0) in fmpz_poly_compose_divconquer()
[all …]
/dports/math/arb/arb-2.21.1/arb_poly/
H A Dcompose_divconquer.c25 if (len1 == 1) in _arb_poly_compose_divconquer()
35 if (len1 == 2) in _arb_poly_compose_divconquer()
45 for (k = 1; (2 << k) < len1; k++) ; in _arb_poly_compose_divconquer()
57 for (i = 0; i < (len1 + 1) / 2; i++) in _arb_poly_compose_divconquer()
63 for (i = 0; i < (len1 - 1) / 2; i++) in _arb_poly_compose_divconquer()
68 hlen[(len1 - 1) / 2] = 0; in _arb_poly_compose_divconquer()
74 for (i = 0, j = 0; i < len1 / 2; i++, j += 2) in _arb_poly_compose_divconquer()
88 if ((len1 & WORD(1))) in _arb_poly_compose_divconquer()
148 const slong len1 = poly1->length; in arb_poly_compose_divconquer() local
151 if (len1 == 0) in arb_poly_compose_divconquer()
[all …]
/dports/math/arb/arb-2.21.1/acb_poly/
H A Dcompose_divconquer.c25 if (len1 == 1) in _acb_poly_compose_divconquer()
35 if (len1 == 2) in _acb_poly_compose_divconquer()
45 for (k = 1; (2 << k) < len1; k++) ; in _acb_poly_compose_divconquer()
57 for (i = 0; i < (len1 + 1) / 2; i++) in _acb_poly_compose_divconquer()
63 for (i = 0; i < (len1 - 1) / 2; i++) in _acb_poly_compose_divconquer()
68 hlen[(len1 - 1) / 2] = 0; in _acb_poly_compose_divconquer()
74 for (i = 0, j = 0; i < len1 / 2; i++, j += 2) in _acb_poly_compose_divconquer()
88 if ((len1 & WORD(1))) in _acb_poly_compose_divconquer()
148 const slong len1 = poly1->length; in acb_poly_compose_divconquer() local
151 if (len1 == 0) in acb_poly_compose_divconquer()
[all …]
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/move/algo/
H A Dadaptive_merge.hpp38 size_type const len = len1+len2;
40 size_type const l_combine1 = len1-collected;
111 size_type len = len1+len2;
145 size_type n_keys = len1/l_block+len2/l_block;
147 const size_type first_half_aux = len1-l_intbuf;
236 , typename iterator_traits<RandIt>::size_type len1
245 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf);
248 const size_type len = len1+len2;
254 if(len1 <= l_block*2 || len2 <= l_block*2){
255 merge_bufferless(first, first+len1, first+len1+len2, comp);
[all …]
/dports/x11-toolkits/gtk40/gtk-4.4.1/gtk/timsort/
H A Dgtktimsort-impl.c447 g_assert (len1 > 0 && len2 > 0 && ELEM (base1, len1) == base2); in gtk_tim_sort()
467 if (len1 == 1) in gtk_tim_sort()
555 if (--len1 == 1) in gtk_tim_sort()
566 if (len1 == 1) in gtk_tim_sort()
572 else if (len1 == 0) in gtk_tim_sort()
610 g_assert (len1 > 0 && len2 > 0 && ELEM (base1, len1) == base2); in gtk_tim_sort()
623 if (--len1 == 0) in gtk_tim_sort()
684 count1 = len1 - gtk_tim_sort(gallop_right) (self, cursor2, base1, len1, len1 - 1); in gtk_tim_sort()
776 len1 -= k; in gtk_tim_sort()
777 if (len1 == 0) in gtk_tim_sort()
[all …]
/dports/net/samba412/samba-4.12.15/libcli/auth/
H A Dmsrpc_parse.c243 uint16_t len1, len2; in msrpc_parse() local
258 if (len1 == 0 && len2 == 0) { in msrpc_parse()
266 … if ((len1 != len2) || (ptr + len1 < ptr) || (ptr + len1 < len1) || (ptr + len1 > blob->length)) { in msrpc_parse()
270 if (len1 & 1) { in msrpc_parse()
281 if (0 < len1) { in msrpc_parse()
306 if (len1 == 0 && len2 == 0) { in msrpc_parse()
313 … if ((len1 != len2) || (ptr + len1 < ptr) || (ptr + len1 < len1) || (ptr + len1 > blob->length)) { in msrpc_parse()
324 if (0 < len1) { in msrpc_parse()
353 … if ((len1 != len2) || (ptr + len1 < ptr) || (ptr + len1 < len1) || (ptr + len1 > blob->length)) { in msrpc_parse()
371 NEED_DATA(len1); in msrpc_parse()
[all …]

12345678910>>...343