Home
last modified time | relevance | path

Searched refs:len1 (Results 201 – 225 of 9962) sorted by relevance

12345678910>>...399

/dports/math/arb/arb-2.21.1/arb_poly/
H A Dcompose_series.c15 _arb_poly_compose_series(arb_ptr res, arb_srcptr poly1, slong len1, in _arb_poly_compose_series() argument
32 for (i = 1, j = len2 - 1; i < len1 && j < n; i++, j += len2 - 1) in _arb_poly_compose_series()
36 if (i + 1 < len1 && j + len2 - 1 < n) in _arb_poly_compose_series()
47 else if (len1 < 6 || n < 6) in _arb_poly_compose_series()
62 slong len1 = poly1->length; in arb_poly_compose_series() local
73 if (len1 == 0 || n == 0) in arb_poly_compose_series()
79 if (len2 == 0 || len1 == 1) in arb_poly_compose_series()
85 lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n); in arb_poly_compose_series()
86 len1 = FLINT_MIN(len1, lenr); in arb_poly_compose_series()
92 _arb_poly_compose_series(res->coeffs, poly1->coeffs, len1, in arb_poly_compose_series()
[all …]
/dports/math/arb/arb-2.21.1/acb_poly/
H A Dcompose_series.c15 _acb_poly_compose_series(acb_ptr res, acb_srcptr poly1, slong len1, in _acb_poly_compose_series() argument
32 for (i = 1, j = len2 - 1; i < len1 && j < n; i++, j += len2 - 1) in _acb_poly_compose_series()
36 if (i + 1 < len1 && j + len2 - 1 < n) in _acb_poly_compose_series()
47 else if (len1 < 6 || n < 6) in _acb_poly_compose_series()
62 slong len1 = poly1->length; in acb_poly_compose_series() local
73 if (len1 == 0 || n == 0) in acb_poly_compose_series()
79 if (len2 == 0 || len1 == 1) in acb_poly_compose_series()
85 lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n); in acb_poly_compose_series()
86 len1 = FLINT_MIN(len1, lenr); in acb_poly_compose_series()
92 _acb_poly_compose_series(res->coeffs, poly1->coeffs, len1, in acb_poly_compose_series()
[all …]
/dports/databases/mysql55-client/mysql-5.5.62/storage/innobase/eval/
H A Deval0eval.c306 ulint len1; in eval_predefined_2() local
429 ulint len1; in eval_substr() local
463 ulint len1; in eval_replstr() local
505 ulint len1; in eval_instr() local
573 ulint len1; in eval_binary_to_number() local
593 ut_memcpy(str2 + (4 - len1), str1, len1); in eval_binary_to_number()
611 ulint len1; in eval_concat() local
619 len += len1; in eval_concat()
635 len += len1; in eval_concat()
658 ulint len1; in eval_to_binary() local
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fq_poly_templates/
H A Dmullow_KS.c29 TEMPLATE(CAP_T, VEC_NORM) (op1, len1, ctx); in _TEMPLATE()
32 if (!len1 | !len2) in _TEMPLATE()
41 f = _fmpz_vec_init(n + len1 + len2); in _TEMPLATE()
43 h = g + len1; in _TEMPLATE()
45 for (i = 0; i < len1; i++) in _TEMPLATE()
54 m = FLINT_MIN(n, len1 + len2 - 1); in _TEMPLATE()
56 if (len1 >= len2) in _TEMPLATE()
57 _fmpz_poly_mullow(f, g, len1, h, len2, m); in _TEMPLATE()
70 _fmpz_vec_clear(f, n + len1 + len2); in _TEMPLATE()
79 const slong len1 = op1->length; in TEMPLATE() local
[all …]
H A Dmulmod_preinv.c22 const TEMPLATE(T, struct) * poly1, slong len1, in _TEMPLATE()
31 lenT = len1 + len2 - 1; in _TEMPLATE()
34 if (len1 + len2 > lenf) /* reduction necessary */ in _TEMPLATE()
39 if (len1 >= len2) in _TEMPLATE()
49 if (len1 >= len2) in _TEMPLATE()
67 slong len1, len2, lenf; in TEMPLATE() local
71 len1 = poly1->length; in TEMPLATE()
80 if (lenf == 1 || len1 == 0 || len2 == 0) in TEMPLATE()
86 if (len1 + len2 - lenf > 0) in TEMPLATE()
98 coeffs1 = _TEMPLATE(T, vec_init) (len1, ctx); in TEMPLATE()
[all …]
/dports/math/e-antic/flint2-ae7ec89/fq_poly_templates/
H A Dmullow_KS.c29 TEMPLATE(CAP_T, VEC_NORM) (op1, len1, ctx); in _TEMPLATE()
32 if (!len1 | !len2) in _TEMPLATE()
41 f = _fmpz_vec_init(n + len1 + len2); in _TEMPLATE()
43 h = g + len1; in _TEMPLATE()
45 for (i = 0; i < len1; i++) in _TEMPLATE()
54 m = FLINT_MIN(n, len1 + len2 - 1); in _TEMPLATE()
56 if (len1 >= len2) in _TEMPLATE()
57 _fmpz_poly_mullow(f, g, len1, h, len2, m); in _TEMPLATE()
70 _fmpz_vec_clear(f, n + len1 + len2); in _TEMPLATE()
79 const slong len1 = op1->length; in TEMPLATE() local
[all …]
H A Dmulmod_preinv.c22 const TEMPLATE(T, struct) * poly1, slong len1, in _TEMPLATE()
31 lenT = len1 + len2 - 1; in _TEMPLATE()
34 if (len1 + len2 > lenf) /* reduction necessary */ in _TEMPLATE()
39 if (len1 >= len2) in _TEMPLATE()
49 if (len1 >= len2) in _TEMPLATE()
67 slong len1, len2, lenf; in TEMPLATE() local
71 len1 = poly1->length; in TEMPLATE()
80 if (lenf == 1 || len1 == 0 || len2 == 0) in TEMPLATE()
86 if (len1 + len2 - lenf > 0) in TEMPLATE()
98 coeffs1 = _TEMPLATE(T, vec_init) (len1, ctx); in TEMPLATE()
[all …]
/dports/math/flint2/flint-2.8.4/fq_poly_templates/
H A Dmullow_KS.c29 TEMPLATE(CAP_T, VEC_NORM) (op1, len1, ctx); in _TEMPLATE()
32 if (!len1 | !len2) in _TEMPLATE()
41 f = _fmpz_vec_init(n + len1 + len2); in _TEMPLATE()
43 h = g + len1; in _TEMPLATE()
45 for (i = 0; i < len1; i++) in _TEMPLATE()
54 m = FLINT_MIN(n, len1 + len2 - 1); in _TEMPLATE()
56 if (len1 >= len2) in _TEMPLATE()
57 _fmpz_poly_mullow(f, g, len1, h, len2, m); in _TEMPLATE()
70 _fmpz_vec_clear(f, n + len1 + len2); in _TEMPLATE()
79 const slong len1 = op1->length; in TEMPLATE() local
[all …]
H A Dmulmod_preinv.c22 const TEMPLATE(T, struct) * poly1, slong len1, in _TEMPLATE()
31 lenT = len1 + len2 - 1; in _TEMPLATE()
34 if (len1 + len2 > lenf) /* reduction necessary */ in _TEMPLATE()
39 if (len1 >= len2) in _TEMPLATE()
49 if (len1 >= len2) in _TEMPLATE()
67 slong len1, len2, lenf; in TEMPLATE() local
71 len1 = poly1->length; in TEMPLATE()
80 if (lenf == 1 || len1 == 0 || len2 == 0) in TEMPLATE()
86 if (len1 + len2 - lenf > 0) in TEMPLATE()
98 coeffs1 = _TEMPLATE(T, vec_init) (len1, ctx); in TEMPLATE()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_mpoly/
H A Dderivative.c20 slong i, len1; in _nmod_mpoly_derivative() local
23 len1 = 0; in _nmod_mpoly_derivative()
34 coeff1[len1] = nmod_mul(coeff2[i], cr, fctx->mod); in _nmod_mpoly_derivative()
36 len1++; in _nmod_mpoly_derivative()
39 return len1; in _nmod_mpoly_derivative()
48 slong i, len1; in _nmod_mpoly_derivative_mp() local
53 len1 = 0; in _nmod_mpoly_derivative_mp()
65 len1++; in _nmod_mpoly_derivative_mp()
70 return len1; in _nmod_mpoly_derivative_mp()
80 slong len1; in nmod_mpoly_derivative() local
[all …]
/dports/math/e-antic/flint2-ae7ec89/nmod_mpoly/
H A Dderivative.c20 slong i, len1; in _nmod_mpoly_derivative() local
23 len1 = 0; in _nmod_mpoly_derivative()
34 coeff1[len1] = nmod_mul(coeff2[i], cr, fctx->mod); in _nmod_mpoly_derivative()
36 len1++; in _nmod_mpoly_derivative()
39 return len1; in _nmod_mpoly_derivative()
48 slong i, len1; in _nmod_mpoly_derivative_mp() local
53 len1 = 0; in _nmod_mpoly_derivative_mp()
65 len1++; in _nmod_mpoly_derivative_mp()
70 return len1; in _nmod_mpoly_derivative_mp()
80 slong len1; in nmod_mpoly_derivative() local
[all …]
/dports/games/libretro-scummvm/scummvm-7b1e929/devtools/create_drascula/
H A Dcreate_drascula.cpp56 int len, len1, pad; in main() local
194 len += 2 + len1 + pad; in main()
216 len += 2 + len1 + pad; in main()
239 len += 2 + len1 + pad; in main()
262 len += 2 + len1 + pad; in main()
285 len += 2 + len1 + pad; in main()
308 len += 2 + len1 + pad; in main()
331 len += 2 + len1 + pad; in main()
354 len += 2 + len1 + pad; in main()
377 len += 2 + len1 + pad; in main()
[all …]
/dports/games/scummvm/scummvm-2.5.1/devtools/create_drascula/
H A Dcreate_drascula.cpp50 int len, len1, pad; in main() local
188 len += 2 + len1 + pad; in main()
210 len += 2 + len1 + pad; in main()
233 len += 2 + len1 + pad; in main()
256 len += 2 + len1 + pad; in main()
279 len += 2 + len1 + pad; in main()
302 len += 2 + len1 + pad; in main()
325 len += 2 + len1 + pad; in main()
348 len += 2 + len1 + pad; in main()
371 len += 2 + len1 + pad; in main()
[all …]
/dports/math/e-antic/flint2-ae7ec89/fmpq_poly/
H A Dadd.c22 slong max = FLINT_MAX(len1, len2); in _fmpq_poly_add_can()
23 slong min = FLINT_MIN(len1, len2); in _fmpq_poly_add_can()
29 _fmpz_poly_add(rpoly, poly1, len1, poly2, len2); in _fmpq_poly_add_can()
62 _fmpz_vec_scalar_mul_fmpz(rpoly, poly1, len1, den2); in _fmpq_poly_add_can()
64 if (len1 < len2) in _fmpq_poly_add_can()
79 if (len1 < len2) in _fmpq_poly_add_can()
122 slong len1 = poly1->length, len2, max; in fmpq_poly_add_can() local
126 fmpq_poly_fit_length(res, len1); in fmpq_poly_add_can()
127 _fmpq_poly_set_length(res, len1); in fmpq_poly_add_can()
143 max = FLINT_MAX(len1, len2); in fmpq_poly_add_can()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpq_poly/
H A Dadd.c22 slong max = FLINT_MAX(len1, len2); in _fmpq_poly_add_can()
23 slong min = FLINT_MIN(len1, len2); in _fmpq_poly_add_can()
29 _fmpz_poly_add(rpoly, poly1, len1, poly2, len2); in _fmpq_poly_add_can()
62 _fmpz_vec_scalar_mul_fmpz(rpoly, poly1, len1, den2); in _fmpq_poly_add_can()
64 if (len1 < len2) in _fmpq_poly_add_can()
79 if (len1 < len2) in _fmpq_poly_add_can()
122 slong len1 = poly1->length, len2, max; in fmpq_poly_add_can() local
126 fmpq_poly_fit_length(res, len1); in fmpq_poly_add_can()
127 _fmpq_poly_set_length(res, len1); in fmpq_poly_add_can()
143 max = FLINT_MAX(len1, len2); in fmpq_poly_add_can()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/wrappers/python/
H A Dc3.i73 (size_t len1, const double * xdata)
77 (size_t len1, const double * evalnd_pt)
104 if (len1 != len2*ft_regress_get_dim(ftr)){ in my_ft_regress_run()
107 len1, len2); in my_ft_regress_run()
123 if (len1 != len2*dim){ in my_cross_validate_init()
126 len1, len2); in my_cross_validate_init()
156 if (len1 != function_train_get_dim(ft)){ in my_function_train_eval()
159 len1,function_train_get_dim(ft)); in my_function_train_eval()
175 if (len1 != function_train_get_dim(ft)){ in my_function_train_gradient_eval()
180 if (len1 != len2){ in my_function_train_gradient_eval()
[all …]
/dports/math/flint2/flint-2.8.4/fmpz_mod_poly/
H A Dmul.c19 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, fmpz_mod_ctx_modulus(ctx)); in fmpz_mod_poly_mul()
59 if (len1 >= len2) in fmpz_mod_poly_mul()
[all …]
/dports/devel/log4j/apache-log4j-1.2.17/src/main/java/org/apache/log4j/helpers/
H A DBoundedFIFO.java133 int len1 = maxSize - first; in resize() local
136 len1 = min(len1, newSize); in resize()
140 len1 = min(len1, numElements); in resize()
143 System.arraycopy(buf, first, tmp, 0, len1); in resize()
147 if((len1 < numElements) && (len1 < newSize)) { in resize()
148 len2 = numElements - len1; in resize()
149 len2 = min(len2, newSize - len1); in resize()
150 System.arraycopy(buf, 0, tmp, len1, len2); in resize()
156 this.numElements = len1+len2; in resize()
/dports/www/netsurf/netsurf-3.10/content/handlers/css/
H A Ddump.c164 css_fixed len1 = 0, len2 = 0; in nscss_dump_computed_style() local
214 dump_css_unit(stream, len1, unit1); in nscss_dump_computed_style()
257 dump_css_unit(stream, len1, unit1); in nscss_dump_computed_style()
465 dump_css_unit(stream, len1, unit1); in nscss_dump_computed_style()
486 dump_css_unit(stream, len1, unit1); in nscss_dump_computed_style()
507 dump_css_unit(stream, len1, unit1); in nscss_dump_computed_style()
528 dump_css_unit(stream, len1, unit1); in nscss_dump_computed_style()
543 dump_css_unit(stream, len1, unit1); in nscss_dump_computed_style()
975 dump_css_unit(stream, len1, unit1); in nscss_dump_computed_style()
1118 dump_css_fixed(stream, len1); in nscss_dump_computed_style()
[all …]
/dports/biology/seqan1/seqan-1.3.1/seqan/graph_align/
H A Dgraph_align_needleman_wunsch.h76 TSize len1 = overallMaxIndex[0]; in _alignNeedlemanWunschTrace() local
80 if (len1 < numCols) _alignTracePrint(align, str, id1, len1, id2, len2, numCols - len1, Horizontal); in _alignNeedlemanWunschTrace()
83 if ((len1 != 0) && (len2 !=0)) { in _alignNeedlemanWunschTrace()
91 --len1; --len2; in _alignNeedlemanWunschTrace()
93 else if (tv == Horizontal) --len1; in _alignNeedlemanWunschTrace()
97 if ((len1 != 0) && (len2 !=0)) { in _alignNeedlemanWunschTrace()
105 --len1; --len2; in _alignNeedlemanWunschTrace()
112 --len1; in _alignNeedlemanWunschTrace()
163 TSize len1 = length(str1); in _alignNeedlemanWunsch() local
167 overallMaxIndex[0] = len1; in _alignNeedlemanWunsch()
[all …]
H A Dgraph_align_gotoh.h65 TSize len1 = overallMaxIndex[0]; in _alignGotohTrace() local
69 …if (len1 < numCols) _alignTracePrint(align, str, id1, len1, id2, len2, numCols - len1, Horizontal… in _alignGotohTrace()
73 if ((len1 != 0) && (len2 !=0)) { in _alignGotohTrace()
103 else --len1; in _alignGotohTrace()
108 --len1; --len2; in _alignGotohTrace()
118 --len1; in _alignGotohTrace()
122 --len1; in _alignGotohTrace()
139 } while ((len1 != 0) && (len2 !=0)); in _alignGotohTrace()
185 TSize len1 = length(str1); in _alignGotoh() local
197 overallMaxIndex[0] = len1; in _alignGotoh()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_poly/
H A Dcompose_series.c20 _nmod_poly_compose_series(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_compose_series() argument
23 if (len1 < 24 || len2 < 8) in _nmod_poly_compose_series()
24 _nmod_poly_compose_series_horner(res, poly1, len1, in _nmod_poly_compose_series()
27 _nmod_poly_compose_series_brent_kung(res, poly1, len1, in _nmod_poly_compose_series()
35 slong len1 = poly1->length; in nmod_poly_compose_series() local
46 if (len1 == 0 || n == 0) in nmod_poly_compose_series()
52 if (len2 == 0 || len1 == 1) in nmod_poly_compose_series()
61 lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n); in nmod_poly_compose_series()
62 len1 = FLINT_MIN(len1, lenr); in nmod_poly_compose_series()
68 _nmod_poly_compose_series(res->coeffs, poly1->coeffs, len1, in nmod_poly_compose_series()
[all …]
H A Dcompose_horner.c17 _nmod_poly_compose_horner(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_compose_horner() argument
20 if (len1 == 1) in _nmod_poly_compose_horner()
26 res[0] = _nmod_poly_evaluate_nmod(poly1, len1, poly2[0], mod); in _nmod_poly_compose_horner()
28 else if (len1 == 2) in _nmod_poly_compose_horner()
35 const slong alloc = (len1 - 1) * (len2 - 1) + 1; in _nmod_poly_compose_horner()
36 slong i = len1 - 1, lenr = len2; in _nmod_poly_compose_horner()
40 if (len1 % 2 == 0) in _nmod_poly_compose_horner()
72 const slong len1 = poly1->length; in nmod_poly_compose_horner() local
75 if (len1 == 0) in nmod_poly_compose_horner()
79 else if (len1 == 1 || len2 == 0) in nmod_poly_compose_horner()
[all …]
/dports/math/e-antic/flint2-ae7ec89/nmod_poly/
H A Dcompose_series.c20 _nmod_poly_compose_series(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_compose_series() argument
23 if (len1 < 24 || len2 < 8) in _nmod_poly_compose_series()
24 _nmod_poly_compose_series_horner(res, poly1, len1, in _nmod_poly_compose_series()
27 _nmod_poly_compose_series_brent_kung(res, poly1, len1, in _nmod_poly_compose_series()
35 slong len1 = poly1->length; in nmod_poly_compose_series() local
46 if (len1 == 0 || n == 0) in nmod_poly_compose_series()
52 if (len2 == 0 || len1 == 1) in nmod_poly_compose_series()
61 lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n); in nmod_poly_compose_series()
62 len1 = FLINT_MIN(len1, lenr); in nmod_poly_compose_series()
68 _nmod_poly_compose_series(res->coeffs, poly1->coeffs, len1, in nmod_poly_compose_series()
[all …]
/dports/math/flint2/flint-2.8.4/nmod_poly/
H A Dcompose_series.c20 _nmod_poly_compose_series(mp_ptr res, mp_srcptr poly1, slong len1, in _nmod_poly_compose_series() argument
23 if (len1 < 24 || len2 < 8) in _nmod_poly_compose_series()
24 _nmod_poly_compose_series_horner(res, poly1, len1, in _nmod_poly_compose_series()
27 _nmod_poly_compose_series_brent_kung(res, poly1, len1, in _nmod_poly_compose_series()
35 slong len1 = poly1->length; in nmod_poly_compose_series() local
46 if (len1 == 0 || n == 0) in nmod_poly_compose_series()
52 if (len2 == 0 || len1 == 1) in nmod_poly_compose_series()
61 lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n); in nmod_poly_compose_series()
62 len1 = FLINT_MIN(len1, lenr); in nmod_poly_compose_series()
68 _nmod_poly_compose_series(res->coeffs, poly1->coeffs, len1, in nmod_poly_compose_series()
[all …]

12345678910>>...399