| /dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/Gaunt/ |
| H A D | nwpw_gaunt.F | 23 integer sizel,sizel2
34 sizel = (gaunt_lmax+1)
35 sizel2 = sizel**2
37 value = BA_alloc_get(mt_dbl,sizel*sizel2*sizel2,
58 indx = i + j*sizel + k*sizel*sizel2
114 integer sizel,sizel2
143 sizel = (gaunt_lmax+1)
144 sizel2 = sizel**2
148 indx = i + j*sizel + k*sizel*sizel2
|
| /dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/nwpwlib/Gaunt/ |
| H A D | nwpw_gaunt.F | 23 integer sizel,sizel2
34 sizel = (gaunt_lmax+1)
35 sizel2 = sizel**2
37 value = BA_alloc_get(mt_dbl,sizel*sizel2*sizel2,
58 indx = i + j*sizel + k*sizel*sizel2
114 integer sizel,sizel2
143 sizel = (gaunt_lmax+1)
144 sizel2 = sizel**2
148 indx = i + j*sizel + k*sizel*sizel2
|
| /dports/science/grib_api/grib_api-1.28.0-Source/src/ |
| H A D | grib_bits_fast_big_endian_vector.c | 26 size_t sizel =(size*nbits)/max_nbits; in grib_decode_long_array() local
31 if (size*nbits%max_nbits) sizel++; in grib_decode_long_array()
33 x=malloc(sizel*sizeof(unsigned long)); in grib_decode_long_array()
35 memcpy(x,p+bitpv/8,sizel*sizeof(x)); in grib_decode_long_array()
125 size_t sizel =(size*nbits)/max_nbits; in grib_decode_double_array() local
130 if (size*nbits%max_nbits) sizel++; in grib_decode_double_array()
134 memcpy(x,p+bitpv/8,sizel*sizeof(x)); in grib_decode_double_array()
222 if (size*nbits%max_nbits) sizel++; in grib_decode_double_array_complex()
226 memcpy(x,p+bitpv/8,sizel*sizeof(x)); in grib_decode_double_array_complex()
275 if (size*nbits%max_nbits) sizel++; in grib_encode_double_array()
[all …]
|
| /dports/science/eccodes/eccodes-2.23.0-Source/src/ |
| H A D | grib_bits_fast_big_endian_vector.c | 27 size_t sizel = (size * nbits) / max_nbits; in grib_decode_long_array() local
33 sizel++; in grib_decode_long_array()
35 x = malloc(sizel * sizeof(unsigned long)); in grib_decode_long_array()
37 memcpy(x, p + bitpv / 8, sizel * sizeof(*x)); in grib_decode_long_array()
126 size_t sizel = (size * nbits) / max_nbits; in grib_decode_double_array() local
132 sizel++; in grib_decode_double_array()
134 x = malloc(sizel * sizeof(unsigned long)); in grib_decode_double_array()
222 size_t sizel = (size * nbits) / max_nbits; in grib_decode_double_array_complex() local
224 sizel++; in grib_decode_double_array_complex()
277 sizel++; in grib_encode_double_array()
[all …]
|
| /dports/games/libretro-fbneo/FBNeo-bbe3c05/src/burner/win32/ |
| H A D | popup_win32.cpp | 116 SIZE sizel = { 0, 0 }; in FBAPopupProc() local
157 if (sizel.cx < line.cx) { in FBAPopupProc()
158 sizel.cx = line.cx; in FBAPopupProc()
160 sizel.cy += line.cy; in FBAPopupProc()
187 if (sizel.cx < sizee.cx) { in FBAPopupProc()
188 sizel.cx = sizee.cx; in FBAPopupProc()
190 sizee.cx = sizel.cx; in FBAPopupProc()
192 if (sizel.cy < 32) { in FBAPopupProc()
193 sizel.cy = 32; in FBAPopupProc()
200 …SetWindowPos(hWnd, NULL, 0, 0, rect.right - rect.left + sizel.cx, rect.bottom - rect.top + sizel.c… in FBAPopupProc()
[all …]
|
| /dports/games/libretro-fbalpha/fbalpha-84eb9d9/src/burner/win32/ |
| H A D | popup_win32.cpp | 116 SIZE sizel = { 0, 0 }; in FBAPopupProc() local
157 if (sizel.cx < line.cx) { in FBAPopupProc()
158 sizel.cx = line.cx; in FBAPopupProc()
160 sizel.cy += line.cy; in FBAPopupProc()
187 if (sizel.cx < sizee.cx) { in FBAPopupProc()
188 sizel.cx = sizee.cx; in FBAPopupProc()
190 sizee.cx = sizel.cx; in FBAPopupProc()
192 if (sizel.cy < 32) { in FBAPopupProc()
193 sizel.cy = 32; in FBAPopupProc()
200 …SetWindowPos(hWnd, NULL, 0, 0, rect.right - rect.left + sizel.cx, rect.bottom - rect.top + sizel.c… in FBAPopupProc()
[all …]
|
| /dports/audio/csound/csound-6.15.0/Opcodes/ |
| H A D | arrays.c | 488 if (sizer<sizel) sizel= sizer; in tabadd()
511 if (sizer<sizel) sizel= sizer; in tabsub()
534 if (sizer<sizel) sizel= sizer; in tabmult()
557 if (sizer<sizel) sizel = sizer; in tabdiv()
585 if (sizer<sizel) sizel = sizer; in tabrem()
615 if (sizer<sizel) sizel = sizer; in tabpow()
964 if (sizer<sizel) sizel= sizer;
1004 if (sizer<sizel) sizel= sizer; in tabasub()
1044 if (sizer<sizel) sizel= sizer; in tabamul()
1084 if (sizer<sizel) sizel= sizer; in tabadiv()
[all …]
|
| /dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 292 ju(sizel) = k; in factorize()
293 u(sizel) = j_it.value(); in factorize()
294 jr(k) = sizel; in factorize()
295 ++sizel; in factorize()
325 while (jj < sizel) in factorize()
374 newpos = sizel; in factorize()
375 sizel++; in factorize()
376 eigen_internal_assert(sizel<=ii); in factorize()
399 sizel = len; in factorize()
400 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/Eigen3/src/itkeigen/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/devel/bullet/bullet3-3.21/examples/ThirdPartyLibs/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 297 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
298 u(sizel) = j_it.value(); in factorize()
299 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
300 ++sizel; in factorize()
330 while (jj < sizel) in factorize()
380 newpos = sizel; in factorize()
381 sizel++; in factorize()
382 eigen_internal_assert(sizel<=ii); in factorize()
405 sizel = len; in factorize()
406 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/graphics/appleseed/appleseed-2.1.0-beta/src/thirdparty/bcd/ext/eigen/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/graphics/blender/blender-2.91.0/extern/Eigen3/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/math/eigen3/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/include/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 294 ju(sizel) = k; in factorize()
295 u(sizel) = j_it.value(); in factorize()
296 jr(k) = sizel; in factorize()
297 ++sizel; in factorize()
327 while (jj < sizel) in factorize()
376 newpos = sizel; in factorize()
377 sizel++; in factorize()
378 eigen_internal_assert(sizel<=ii); in factorize()
401 sizel = len; in factorize()
402 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/cvxcore/include/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/eigen/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/eigen/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/science/getdp/getdp-3.4.0-source/contrib/eigen/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/math/R-cran-RcppEigen/RcppEigen/inst/include/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/devel/upp/upp/uppsrc/plugin/Eigen/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 297 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
298 u(sizel) = j_it.value(); in factorize()
299 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
300 ++sizel; in factorize()
330 while (jj < sizel) in factorize()
380 newpos = sizel; in factorize()
381 sizel++; in factorize()
382 eigen_internal_assert(sizel<=ii); in factorize()
405 sizel = len; in factorize()
406 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/devel/vcglib/vcglib-2020.09/eigenlib/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 304 ju(sizel) = k; in factorize()
305 u(sizel) = j_it.value(); in factorize()
306 jr(k) = sizel; in factorize()
307 ++sizel; in factorize()
337 while (jj < sizel) in factorize()
386 newpos = sizel; in factorize()
387 sizel++; in factorize()
388 eigen_internal_assert(sizel<=ii); in factorize()
411 sizel = len; in factorize()
412 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/science/pcmsolver/pcmsolver-1.3.0/external/eigen3/include/eigen3/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|
| /dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/Eigen/src/IterativeLinearSolvers/ |
| H A D | IncompleteLUT.h | 306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
414 sizel = len; in factorize()
415 len = (std::min)(sizel, nnzL); in factorize()
[all …]
|