/dports/math/py-bottleneck/Bottleneck-1.3.2/bottleneck/src/ |
H A D | reduce_template.c | 110 asum = 0; in REDUCE_ONE() 138 npy_DTYPE0 asum; in REDUCE_ONE() local 145 asum = 0; in REDUCE_ONE() 195 asum = 0; in REDUCE_ONE() 237 npy_DTYPE1 asum; in REDUCE_ONE() local 244 asum = 0; in REDUCE_ONE() 285 asum = 0; in REDUCE_ALL() 315 asum = 0; in REDUCE_ONE() 333 asum = FUNC(asum / (count - ddof)); in REDUCE_ONE() 360 asum = 0; in REDUCE_ALL() [all …]
|
/dports/science/siconos/siconos-4.4.0/externals/numeric_bindings/boost/numeric/bindings/blas/level1/ |
H A D | asum.hpp | 66 inline float asum( const int n, const float* x, const int incx ) { in asum() function 75 inline double asum( const int n, const double* x, const int incx ) { in asum() function 84 inline float asum( const int n, const std::complex<float>* x, in asum() function 94 inline double asum( const int n, const std::complex<double>* x, in asum() function 105 inline float asum( const int n, const float* x, const int incx ) { 123 inline float asum( const int n, const std::complex<float>* x, 133 inline double asum( const int n, const std::complex<double>* x, 144 inline float asum( const fortran_int_t n, const float* x, 154 inline double asum( const fortran_int_t n, const double* x, 203 return detail::asum( bindings::size(x), in invoke() [all …]
|
/dports/science/quantum-espresso/q-e-qe-6.7.0/upflib/ |
H A D | simpsn.f90 | 27 real(DP), INTENT(out):: asum local 32 asum = 0.0d0 40 asum = asum + f1 + 4.0d0 * f2 + f3 76 real(DP), INTENT(out):: asum local 88 asum = ( func(1)*rab(1) + func(mesh )*rab(mesh ) )*c(1) & 93 asum = asum + func(i)*rab(i) 110 real(DP), INTENT(out):: asum local 117 asum=0.0d0 129 func(i1)=asum+a1*rab(i1) 131 func(i)=asum+a1*rab(i) [all …]
|
/dports/science/qmcpack/qmcpack-3.11.0/external_codes/boost_multi/multi/adaptors/blas/test/ |
H A D | asum.cpp | 27 using multi::blas::asum; in BOOST_AUTO_TEST_CASE() 28 …BOOST_REQUIRE(asum(A[1]) == std::accumulate(begin(A[1]), end(A[1]), 0., [](auto&& a, auto&& b){ret… in BOOST_AUTO_TEST_CASE() 38 using multi::blas::asum; in BOOST_AUTO_TEST_CASE() 39 …BOOST_REQUIRE(asum(A[1]) == std::accumulate(begin(A[1]), end(A[1]), 0., [](auto&& a, auto&& b){ret… in BOOST_AUTO_TEST_CASE() 48 using multi::blas::asum; in BOOST_AUTO_TEST_CASE() 49 BOOST_REQUIRE(asum(A[1]) == 26 ); in BOOST_AUTO_TEST_CASE() 62 BOOST_REQUIRE( blas::asum(A[1]) == 29. ); in BOOST_AUTO_TEST_CASE() 63 BOOST_REQUIRE( blas::asum(A[1]({0, 4})) == 29. ); in BOOST_AUTO_TEST_CASE() 73 using multi::blas::asum; in BOOST_AUTO_TEST_CASE() 74 BOOST_REQUIRE( asum(A[1]) == Z{29.} ); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/graphics/lazpaint/lazpaint-7.1.6/bgrabitmapnew/bgrabitmap/ |
H A D | bgraresample.pas | 472 (g + (asum shr 1)) div asum, 473 (b + (asum shr 1)) div asum, 477 (g + (asum shr 1)) div asum, 478 (b + (asum shr 1)) div asum, 564 (g + (asum shr 1)) div asum, 565 (b + (asum shr 1)) div asum, 569 (g + (asum shr 1)) div asum, 570 (b + (asum shr 1)) div asum, 682 (g + (asum shr 1)) div asum, 683 (b + (asum shr 1)) div asum, [all …]
|
/dports/editors/cudatext/CudaText-1.151.0/bgrabitmap/bgrabitmap/ |
H A D | bgraresample.pas | 472 (g + (asum shr 1)) div asum, 473 (b + (asum shr 1)) div asum, 477 (g + (asum shr 1)) div asum, 478 (b + (asum shr 1)) div asum, 564 (g + (asum shr 1)) div asum, 565 (b + (asum shr 1)) div asum, 569 (g + (asum shr 1)) div asum, 570 (b + (asum shr 1)) div asum, 682 (g + (asum shr 1)) div asum, 683 (b + (asum shr 1)) div asum, [all …]
|
/dports/math/mpsolve/mpsolve-3.2.1/src/libmps/secular/ |
H A D | secular-newton.c | 153 asum = 0.0; in mps_secular_fnewton() 198 asum += 1.0; in mps_secular_fnewton() 212 asum_on_apol = asum / apol; in mps_secular_fnewton() 295 rdpe_add_eq (asum, rtmp); in mps_secular_dparallel_sum() 297 rdpe_add_eq (asum, rtmp); in mps_secular_dparallel_sum() 336 rdpe_set (asum, rdpe_zero); in mps_secular_dnewton() 387 rdpe_add_eq (asum, rdpe_one); in mps_secular_dnewton() 499 rdpe_add_eq (asum, rtmp); in mps_secular_mparallel_sum() 551 rdpe_set (asum, rdpe_zero); in mps_secular_mnewton() 586 rdpe_set (asum, rdpe_zero); in mps_secular_mnewton() [all …]
|
/dports/security/pbc/pbc-0.5.14/arith/ |
H A D | dlog.c | 22 element_init_same_as(ss->a, asum); 25 element_set(ss->a, asum); 62 element_t asum; 76 element_init(asum, Zr); 91 element_random(asum); 93 element_pow_zn(g0, g, asum); 111 element_add(asum, asum, a[i]); 118 element_sub(asum, ss->a, asum); 130 element_to_mpz(za, asum); 154 element_div(x, asum, bsum); [all …]
|
/dports/science/qmcpack/qmcpack-3.11.0/external_codes/boost_multi/multi/adaptors/blas/ |
H A D | asum.hpp | 17 ->decltype(asum(n, base(first), stride(first))){ in asum_n() 18 return asum(n, base(first), stride(first));} in asum_n() 23 auto asum(It f, It last) in asum() function 30 auto asum(X1D const& x) in asum() function 31 ->decltype(asum(begin(x), end(x))){assert( not offset(x) ); in asum() 32 return asum(begin(x), end(x));} in asum() 50 using multi::blas::asum; 58 …BOOST_REQUIRE(asum(A[1]) == std::accumulate(begin(A[1]), end(A[1]), 0., [](auto&& a, auto&& b){ret… in BOOST_AUTO_TEST_CASE() 69 BOOST_REQUIRE(asum(rotated(A)[0]) == 1.+1. + 5.+3. + 9.+2.); in BOOST_AUTO_TEST_CASE()
|
/dports/math/openblas/OpenBLAS-0.3.18/kernel/arm64/ |
H A D | casum_thunderx2t99.c | 133 FLOAT asum = 0.0 ; in casum_compute() local 135 if ( n < 0 ) return(asum); in casum_compute() 203 : [ASUM_] "=r" (asum) //%0 in casum_compute() 213 return asum; in casum_compute() 233 FLOAT asum = 0.0; in CNAME() local 242 asum = casum_compute(n, x, inc_x); in CNAME() 256 asum = asum + (*ptr); in CNAME() 261 asum = casum_compute(n, x, inc_x); in CNAME() 264 return asum; in CNAME()
|
H A D | sasum_thunderx2t99.c | 129 FLOAT asum = 0.0 ; in sasum_compute() local 131 if ( n < 0 ) return(asum); in sasum_compute() 200 : [ASUM_] "=r" (asum) //%0 in sasum_compute() 210 return asum; in sasum_compute() 230 FLOAT asum = 0.0; in CNAME() local 239 asum = sasum_compute(n, x, inc_x); in CNAME() 253 asum = asum + (*ptr); in CNAME() 258 asum = sasum_compute(n, x, inc_x); in CNAME() 261 return asum; in CNAME()
|
H A D | dasum_thunderx2t99.c | 127 FLOAT asum = 0.0 ; in dasum_compute() local 129 if ( n < 0 ) return(asum); in dasum_compute() 198 : [ASUM_] "=r" (asum) //%0 in dasum_compute() 208 return asum; in dasum_compute() 228 FLOAT asum = 0.0; in CNAME() local 237 asum = dasum_compute(n, x, inc_x); in CNAME() 251 asum = asum + (*ptr); in CNAME() 256 asum = dasum_compute(n, x, inc_x); in CNAME() 259 return asum; in CNAME()
|
H A D | zasum_thunderx2t99.c | 129 FLOAT asum = 0.0 ; in zasum_compute() local 131 if ( n < 0 ) return(asum); in zasum_compute() 200 : [ASUM_] "=r" (asum) //%0 in zasum_compute() 210 return asum; in zasum_compute() 230 FLOAT asum = 0.0; in CNAME() local 239 asum = zasum_compute(n, x, inc_x); in CNAME() 253 asum = asum + (*ptr); in CNAME() 258 asum = zasum_compute(n, x, inc_x); in CNAME() 261 return asum; in CNAME()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/special/cephes/ |
H A D | hyperg.c | 87 asum = hy1f1a(a, b, x, &acanc); 93 asum = hy1f1p(a, b, x, &acanc); 100 psum = asum; 217 asum = NPY_INFINITY; 247 asum = h1; 249 asum = h2; 255 asum *= temp; 260 if (asum != 0.0) 261 acanc /= fabs(asum); 267 if (asum == NPY_INFINITY || asum == -NPY_INFINITY) [all …]
|
/dports/science/siconos/siconos-4.4.0/externals/numeric_bindings/libs/numeric/bindings/doc/blas/level1/ |
H A D | asum.qbk | 7 [section asum] 10 There is one prototype of `asum` available, please see below. 12 asum( const VectorX& x ); 18 `asum` (short for absolute sum) provides a C++ 28 [table Dispatching of asum. 38 whereas `asum` requires one arguments. 40 [table Deduction of arguments of asum. 44 Defined in header [headerref boost/numeric/bindings/blas/level1/asum.hpp]. 62 #include <boost/numeric/bindings/blas/level1/asum.hpp> 65 blas::asum( x, y, z );
|
/dports/math/blis/blis-0.8.1/vendor/testcpp/ |
H A D | test_asum.cc | 48 TR *asum in ref_asum() argument 70 bli_obj_create_with_attached_buffer( dtR, 1, 1, asum, 1, 1,&obj_asum ); in ref_asum() 80 TR asum, asum_ref; in test_asum() local 94 asum = blis::asum<T>( in test_asum() 101 cout<< "Sum of all values in Vector X: " << asum << "\n"; in test_asum() 109 if(computeErrorV(incx, incx, 1, &asum, &asum_ref )==1) in test_asum()
|
/dports/math/gretl/gretl-2021d/cephes/ |
H A D | hyperg.c | 76 double asum, psum, acanc, temp, pcanc = 0; in hyperg() local 88 asum = hy1f1a(a, b, x, &acanc); in hyperg() 93 psum = asum; in hyperg() 183 double h1, h2, t, u, temp, acanc, asum, err1, err2; in hy1f1a() local 187 asum = MAXNUM; in hy1f1a() 217 asum = h1; in hy1f1a() 219 asum = h2; in hy1f1a() 225 asum *= temp; in hy1f1a() 229 if (asum != 0.0) in hy1f1a() 230 acanc /= fabs(asum); in hy1f1a() [all …]
|
/dports/math/grace/grace-5.1.25/cephes/ |
H A D | hyperg.c | 75 double asum, psum, acanc, pcanc=0; local 94 asum = hy1f1a( a, b, x, &acanc ); 102 psum = asum; 211 double h1, h2, t, u, temp, acanc, asum, err1, err2; local 216 asum = MAXNUM; 247 asum = h1; 249 asum = h2; 257 asum *= temp; 262 if( asum != 0.0 ) 263 acanc /= fabs(asum); [all …]
|
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapDown.cpp | 47 double ai, asum, a2sum, maxbound, maxfree, t; in QPNapDown() local 58 asum = 0.; in QPNapDown() 78 asum += x[i] * ai; in QPNapDown() 86 asum += ai; in QPNapDown() 99 double s = asum - new_break * a2sum; in QPNapDown() 104 lambda = (asum - b) / a2sum; in QPNapDown() 126 asum += ai * (1. - x[e]); in QPNapDown() 143 asum += ai * x[e]; in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 46 double ai, asum, a2sum, minbound, minfree, t; in QPNapUp() local 57 asum = 0.; in QPNapUp() 68 asum += ai; in QPNapUp() 77 asum += x[i] * ai; in QPNapUp() 93 double s = asum - new_break * a2sum; in QPNapUp() 98 lambda = (asum - b) / a2sum; in QPNapUp() 120 asum -= ai * x[e]; in QPNapUp() 137 asum += ai * (x[e] - 1.); in QPNapUp()
|
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 46 double ai, asum, a2sum, minbound, minfree, t; in QPNapUp() local 57 asum = 0.; in QPNapUp() 68 asum += ai; in QPNapUp() 77 asum += x[i] * ai; in QPNapUp() 93 double s = asum - new_break * a2sum; in QPNapUp() 98 lambda = (asum - b) / a2sum; in QPNapUp() 120 asum -= ai * x[e]; in QPNapUp() 137 asum += ai * (x[e] - 1.); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 47 double ai, asum, a2sum, maxbound, maxfree, t; in QPNapDown() local 58 asum = 0.; in QPNapDown() 78 asum += x[i] * ai; in QPNapDown() 86 asum += ai; in QPNapDown() 99 double s = asum - new_break * a2sum; in QPNapDown() 104 lambda = (asum - b) / a2sum; in QPNapDown() 126 asum += ai * (1. - x[e]); in QPNapDown() 143 asum += ai * x[e]; in QPNapDown()
|
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 46 double ai, asum, a2sum, minbound, minfree, t; in QPNapUp() local 57 asum = 0.; in QPNapUp() 68 asum += ai; in QPNapUp() 77 asum += x[i] * ai; in QPNapUp() 93 double s = asum - new_break * a2sum; in QPNapUp() 98 lambda = (asum - b) / a2sum; in QPNapUp() 120 asum -= ai * x[e]; in QPNapUp() 137 asum += ai * (x[e] - 1.); in QPNapUp()
|
/dports/math/suitesparse-config/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 46 double ai, asum, a2sum, minbound, minfree, t; in QPNapUp() local 57 asum = 0.; in QPNapUp() 68 asum += ai; in QPNapUp() 77 asum += x[i] * ai; in QPNapUp() 93 double s = asum - new_break * a2sum; in QPNapUp() 98 lambda = (asum - b) / a2sum; in QPNapUp() 120 asum -= ai * x[e]; in QPNapUp() 137 asum += ai * (x[e] - 1.); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 47 double ai, asum, a2sum, maxbound, maxfree, t; in QPNapDown() local 58 asum = 0.; in QPNapDown() 78 asum += x[i] * ai; in QPNapDown() 86 asum += ai; in QPNapDown() 99 double s = asum - new_break * a2sum; in QPNapDown() 104 lambda = (asum - b) / a2sum; in QPNapDown() 126 asum += ai * (1. - x[e]); in QPNapDown() 143 asum += ai * x[e]; in QPNapDown()
|