| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_poly/ |
| H A D | resultant_euclidean.c | 30 if (len1 == 1) in _nmod_poly_resultant_euclidean()
34 else if (len1 == 2) in _nmod_poly_resultant_euclidean()
51 w = _nmod_vec_init(3 * len1); in _nmod_poly_resultant_euclidean()
53 v = w + len1; in _nmod_poly_resultant_euclidean()
54 r = v + len1; in _nmod_poly_resultant_euclidean()
56 _nmod_vec_set(u, poly1, len1); in _nmod_poly_resultant_euclidean()
58 l1 = len1; in _nmod_poly_resultant_euclidean()
111 const slong len1 = f->length; in nmod_poly_resultant_euclidean() local
115 if (len1 == 0 || len2 == 0) in nmod_poly_resultant_euclidean()
121 if (len1 >= len2) in nmod_poly_resultant_euclidean()
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/nmod_poly/ |
| H A D | resultant_euclidean.c | 30 if (len1 == 1) in _nmod_poly_resultant_euclidean()
34 else if (len1 == 2) in _nmod_poly_resultant_euclidean()
51 w = _nmod_vec_init(3 * len1); in _nmod_poly_resultant_euclidean()
53 v = w + len1; in _nmod_poly_resultant_euclidean()
54 r = v + len1; in _nmod_poly_resultant_euclidean()
56 _nmod_vec_set(u, poly1, len1); in _nmod_poly_resultant_euclidean()
58 l1 = len1; in _nmod_poly_resultant_euclidean()
111 const slong len1 = f->length; in nmod_poly_resultant_euclidean() local
115 if (len1 == 0 || len2 == 0) in nmod_poly_resultant_euclidean()
121 if (len1 >= len2) in nmod_poly_resultant_euclidean()
[all …]
|
| /dports/math/flint2/flint-2.8.4/nmod_poly/ |
| H A D | resultant_euclidean.c | 30 if (len1 == 1) in _nmod_poly_resultant_euclidean()
34 else if (len1 == 2) in _nmod_poly_resultant_euclidean()
51 w = _nmod_vec_init(3 * len1); in _nmod_poly_resultant_euclidean()
53 v = w + len1; in _nmod_poly_resultant_euclidean()
54 r = v + len1; in _nmod_poly_resultant_euclidean()
56 _nmod_vec_set(u, poly1, len1); in _nmod_poly_resultant_euclidean()
58 l1 = len1; in _nmod_poly_resultant_euclidean()
111 const slong len1 = f->length; in nmod_poly_resultant_euclidean() local
115 if (len1 == 0 || len2 == 0) in nmod_poly_resultant_euclidean()
121 if (len1 >= len2) in nmod_poly_resultant_euclidean()
[all …]
|
| /dports/math/cln/cln-1.3.6/src/base/digitseq/ |
| H A D | cl_DS_mul_kara.h | 1 static void mulu_karatsuba (const uintD* sourceptr1, uintC len1, in mulu_karatsuba() argument
45 if (len1 == len2) in mulu_karatsuba()
48 if (len2 >= 2*len1) in mulu_karatsuba()
132 destptr = destptr lspop len1; in mulu_karatsuba()
138 destptr = destptr lspop len1; in mulu_karatsuba()
139 copy_loop_lsp(prod_LSDptr lspop len1,destptr,len1); in mulu_karatsuba()
142 sourceptr2 = sourceptr2 lspop len1; len2 -= len1; in mulu_karatsuba()
144 while (len2 >= 2*len1); in mulu_karatsuba()
151 var uintC prod_len = len1+len2; in mulu_karatsuba()
254 addto_loop_lsp(prod_LSDptr,destptr,len1); in mulu_karatsuba()
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/fmpz_mpoly/ |
| H A D | derivative.c | 18 slong i, len1; in _fmpz_mpoly_derivative() local
22 len1 = 0; in _fmpz_mpoly_derivative()
30 len1++; in _fmpz_mpoly_derivative()
34 return len1; in _fmpz_mpoly_derivative()
42 slong i, len1; in _fmpz_mpoly_derivative_mp() local
47 len1 = 0; in _fmpz_mpoly_derivative_mp()
54 fmpz_mul(coeff1 + len1, coeff2 + i, c); in _fmpz_mpoly_derivative_mp()
55 len1++; in _fmpz_mpoly_derivative_mp()
61 return len1; in _fmpz_mpoly_derivative_mp()
71 slong len1; in fmpz_mpoly_derivative() local
[all …]
|
| /dports/math/flint2/flint-2.8.4/fmpz_mpoly/ |
| H A D | derivative.c | 18 slong i, len1; in _fmpz_mpoly_derivative() local
22 len1 = 0; in _fmpz_mpoly_derivative()
30 len1++; in _fmpz_mpoly_derivative()
34 return len1; in _fmpz_mpoly_derivative()
42 slong i, len1; in _fmpz_mpoly_derivative_mp() local
47 len1 = 0; in _fmpz_mpoly_derivative_mp()
54 fmpz_mul(coeff1 + len1, coeff2 + i, c); in _fmpz_mpoly_derivative_mp()
55 len1++; in _fmpz_mpoly_derivative_mp()
61 return len1; in _fmpz_mpoly_derivative_mp()
71 slong len1; in fmpz_mpoly_derivative() local
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_mpoly/ |
| H A D | derivative.c | 18 slong i, len1; in _fmpz_mpoly_derivative() local
22 len1 = 0; in _fmpz_mpoly_derivative()
30 len1++; in _fmpz_mpoly_derivative()
34 return len1; in _fmpz_mpoly_derivative()
42 slong i, len1; in _fmpz_mpoly_derivative_mp() local
47 len1 = 0; in _fmpz_mpoly_derivative_mp()
54 fmpz_mul(coeff1 + len1, coeff2 + i, c); in _fmpz_mpoly_derivative_mp()
55 len1++; in _fmpz_mpoly_derivative_mp()
61 return len1; in _fmpz_mpoly_derivative_mp()
71 slong len1; in fmpz_mpoly_derivative() local
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
110 size_type len = len1+len2; in adaptive_merge_final_merge()
126 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
128 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
217 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
226 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
229 const size_type len = len1+len2; in adaptive_merge_impl()
235 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
236 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
110 size_type len = len1+len2; in adaptive_merge_final_merge()
126 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
128 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
217 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
226 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
229 const size_type len = len1+len2; in adaptive_merge_impl()
235 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
236 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 44 size_type const len = size_type(len1+len2); in adaptive_merge_combine_blocks()
46 size_type const l_combine1 = size_type(len1-collected); in adaptive_merge_combine_blocks()
118 size_type len = size_type(len1+len2); in adaptive_merge_final_merge()
225 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
233 if(xbuf.capacity() >= min_value<size_type>(len1, len2)){ in adaptive_merge_impl()
234 buffered_merge( first, first+len1 in adaptive_merge_impl()
235 , first + len1+len2, comp, xbuf); in adaptive_merge_impl()
238 const size_type len = size_type(len1+len2); in adaptive_merge_impl()
244 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
245 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
110 size_type len = len1+len2; in adaptive_merge_final_merge()
126 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
128 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
217 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
226 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
229 const size_type len = len1+len2; in adaptive_merge_impl()
235 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
236 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
112 size_type len = len1+len2; in adaptive_merge_final_merge()
128 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
130 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
219 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
228 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
231 const size_type len = len1+len2; in adaptive_merge_impl()
237 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
238 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
112 size_type len = len1+len2; in adaptive_merge_final_merge()
128 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
130 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
219 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
228 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
231 const size_type len = len1+len2; in adaptive_merge_impl()
237 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
238 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
112 size_type len = len1+len2; in adaptive_merge_final_merge()
128 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
130 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
219 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
228 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
231 const size_type len = len1+len2; in adaptive_merge_impl()
237 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
238 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
112 size_type len = len1+len2; in adaptive_merge_final_merge()
128 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
130 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
219 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
228 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
231 const size_type len = len1+len2; in adaptive_merge_impl()
237 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
238 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
112 size_type len = len1+len2; in adaptive_merge_final_merge()
128 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
130 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
219 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
228 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
231 const size_type len = len1+len2; in adaptive_merge_impl()
237 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
238 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/move/algo/ |
| H A D | adaptive_merge.hpp | 38 size_type const len = len1+len2; in adaptive_merge_combine_blocks()
40 size_type const l_combine1 = len1-collected; in adaptive_merge_combine_blocks()
112 size_type len = len1+len2; in adaptive_merge_final_merge()
128 size_type n_keys = len1/l_block+len2/l_block; in adaptive_merge_n_keys_without_external_keys()
130 const size_type first_half_aux = len1-l_intbuf; in adaptive_merge_n_keys_without_external_keys()
219 , typename iterator_traits<RandIt>::size_type len1 in adaptive_merge_impl() argument
228 buffered_merge(first, first+len1, first+(len1+len2), comp, xbuf); in adaptive_merge_impl()
231 const size_type len = len1+len2; in adaptive_merge_impl()
237 if(len1 <= l_block*2 || len2 <= l_block*2){ in adaptive_merge_impl()
238 merge_bufferless(first, first+len1, first+len1+len2, comp); in adaptive_merge_impl()
[all …]
|
| /dports/math/arb/arb-2.21.1/arb_poly/test/ |
| H A D | t-product_roots_complex.c | 27 slong prec, len1, len2, i; in main() local
34 len1 = n_randint(state, 12); in main()
41 r = _arb_vec_init(len1); in main()
43 r3 = _acb_vec_init(len1 + 2 * len2); in main()
45 for (i = 0; i < len1; i++) in main()
50 for (i = 0; i < len1; i++) in main()
53 acb_set(r3 + len1 + i, r2 + i); in main()
55 acb_conj(r3 + len1 + len2 + i, r2 + i); in main()
67 for (i = 0; i < len1; i++) in main()
88 _arb_vec_clear(r, len1); in main()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/flang/test/Semantics/ |
| H A D | final01.f90 | 8 type :: parent(kind1, len1)
10 integer, len :: len1 = 1
50 type(child(len1=*, len2=*)), intent(inout) :: x
53 type(child(len1=*, len2=*)), intent(inout) :: x
56 type(child(len1=*, len2=*)), intent(inout) :: x
68 type(child(kind1=4, len1=*, len2=*)), value :: x
77 type(child(kind1=7, len1=*, len2=*)) :: x[*]
80 class(child(kind1=8, len1=*, len2=*)) :: x
89 type(child(kind1=11, len1=*, len2=*)) :: x, y
97 type(child(kind1=14, len1=*,len2=2)) :: x
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/flang/test/Semantics/ |
| H A D | final01.f90 | 9 type :: parent(kind1, len1)
11 integer, len :: len1 = 1
51 type(child(len1=*, len2=*)), intent(inout) :: x
54 type(child(len1=*, len2=*)), intent(inout) :: x
57 type(child(len1=*, len2=*)), intent(inout) :: x
69 type(child(kind1=4, len1=*, len2=*)), value :: x
78 type(child(kind1=7, len1=*, len2=*)) :: x[*]
81 class(child(kind1=8, len1=*, len2=*)) :: x
90 type(child(kind1=11, len1=*, len2=*)) :: x, y
98 type(child(kind1=14, len1=*,len2=2)) :: x
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/flang/test/Semantics/ |
| H A D | final01.f90 | 8 type :: parent(kind1, len1)
10 integer, len :: len1 = 1
50 type(child(len1=*, len2=*)), intent(inout) :: x
53 type(child(len1=*, len2=*)), intent(inout) :: x
56 type(child(len1=*, len2=*)), intent(inout) :: x
68 type(child(kind1=4, len1=*, len2=*)), value :: x
77 type(child(kind1=7, len1=*, len2=*)) :: x[*]
80 class(child(kind1=8, len1=*, len2=*)) :: x
89 type(child(kind1=11, len1=*, len2=*)) :: x, y
97 type(child(kind1=14, len1=*,len2=2)) :: x
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/flang/test/Semantics/ |
| H A D | final01.f90 | 8 type :: parent(kind1, len1)
10 integer, len :: len1 = 1
50 type(child(len1=*, len2=*)), intent(inout) :: x
53 type(child(len1=*, len2=*)), intent(inout) :: x
56 type(child(len1=*, len2=*)), intent(inout) :: x
68 type(child(kind1=4, len1=*, len2=*)), value :: x
77 type(child(kind1=7, len1=*, len2=*)) :: x[*]
80 class(child(kind1=8, len1=*, len2=*)) :: x
89 type(child(kind1=11, len1=*, len2=*)) :: x, y
97 type(child(kind1=14, len1=*,len2=2)) :: x
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/flang/test/Semantics/ |
| H A D | final01.f90 | 9 type :: parent(kind1, len1)
11 integer, len :: len1 = 1
51 type(child(len1=*, len2=*)), intent(inout) :: x
54 type(child(len1=*, len2=*)), intent(inout) :: x
57 type(child(len1=*, len2=*)), intent(inout) :: x
69 type(child(kind1=4, len1=*, len2=*)), value :: x
78 type(child(kind1=7, len1=*, len2=*)) :: x[*]
81 class(child(kind1=8, len1=*, len2=*)) :: x
90 type(child(kind1=11, len1=*, len2=*)) :: x, y
98 type(child(kind1=14, len1=*,len2=2)) :: x
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/flang/test/Semantics/ |
| H A D | final01.f90 | 8 type :: parent(kind1, len1)
10 integer, len :: len1 = 1
50 type(child(len1=*, len2=*)), intent(inout) :: x
53 type(child(len1=*, len2=*)), intent(inout) :: x
56 type(child(len1=*, len2=*)), intent(inout) :: x
68 type(child(kind1=4, len1=*, len2=*)), value :: x
77 type(child(kind1=7, len1=*, len2=*)) :: x[*]
80 class(child(kind1=8, len1=*, len2=*)) :: x
89 type(child(kind1=11, len1=*, len2=*)) :: x, y
97 type(child(kind1=14, len1=*,len2=2)) :: x
[all …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/flang/test/Semantics/ |
| H A D | final01.f90 | 9 type :: parent(kind1, len1)
11 integer, len :: len1 = 1
51 type(child(len1=*, len2=*)), intent(inout) :: x
54 type(child(len1=*, len2=*)), intent(inout) :: x
57 type(child(len1=*, len2=*)), intent(inout) :: x
69 type(child(kind1=4, len1=*, len2=*)), value :: x
78 type(child(kind1=7, len1=*, len2=*)) :: x[*]
81 class(child(kind1=8, len1=*, len2=*)) :: x
90 type(child(kind1=11, len1=*, len2=*)) :: x, y
98 type(child(kind1=14, len1=*,len2=2)) :: x
[all …]
|