| /dports/science/mpqc/mpqc-2.3.1/src/lib/chemistry/qc/mbptr12/ |
| H A D | twobodygrid.cc | 92 const int nelem2 = keyval->count("r2"); in TwoBodyGrid() local
95 if (nelem2 == 0) in TwoBodyGrid()
97 if (nelem1 != nelem2 && nelem1 != 1 && nelem2 != 1) in TwoBodyGrid()
101 const int nelem = (nelem1 > nelem2) ? nelem1 : nelem2; in TwoBodyGrid()
143 if (nelem2 == 1) { in TwoBodyGrid()
|
| /dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/ |
| H A D | zeta_calc.f | 971 nelem2=nint(prop(index+3))
988 node12=kon(ipkon(nelem2)+1)
989 node22=kon(ipkon(nelem2)+3)
990 nodem2=kon(ipkon(nelem2)+2)
1134 elseif(nelem.eq.nelem2) then
1162 elseif(nelem.eq.nelem2) then
1176 elseif(nelem.eq.nelem2) then
1286 if(nelem.eq.nelem2) then
1349 elseif(nelem.eq.nelem2) then
1386 elseif(nelem.eq.nelem2) then
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/sort/block_indirect_sort/blk_detail/ |
| H A D | parallel_sort.hpp | 152 size_t nelem2 = nelem >> 1; in parallel_sort() local
154 for (size_t i = 0; i < nelem2; ++i) in parallel_sort()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/sort/block_indirect_sort/blk_detail/ |
| H A D | parallel_sort.hpp | 152 size_t nelem2 = nelem >> 1; in parallel_sort() local
154 for (size_t i = 0; i < nelem2; ++i) in parallel_sort()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/sort/block_indirect_sort/blk_detail/ |
| H A D | parallel_sort.hpp | 152 size_t nelem2 = nelem >> 1; in parallel_sort() local
154 for (size_t i = 0; i < nelem2; ++i) in parallel_sort()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/sort/block_indirect_sort/blk_detail/ |
| H A D | parallel_sort.hpp | 152 size_t nelem2 = nelem >> 1; in parallel_sort() local
154 for (size_t i = 0; i < nelem2; ++i) in parallel_sort()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/sort/block_indirect_sort/blk_detail/ |
| H A D | parallel_sort.hpp | 152 size_t nelem2 = nelem >> 1; in parallel_sort() local
154 for (size_t i = 0; i < nelem2; ++i) in parallel_sort()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/sort/block_indirect_sort/blk_detail/ |
| H A D | parallel_sort.hpp | 152 size_t nelem2 = nelem >> 1; in parallel_sort() local
154 for (size_t i = 0; i < nelem2; ++i) in parallel_sort()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/sort/block_indirect_sort/blk_detail/ |
| H A D | parallel_sort.hpp | 152 size_t nelem2 = nelem >> 1; in parallel_sort() local
154 for (size_t i = 0; i < nelem2; ++i) in parallel_sort()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/sort/block_indirect_sort/blk_detail/ |
| H A D | parallel_sort.hpp | 152 size_t nelem2 = nelem >> 1; in parallel_sort() local
154 for (size_t i = 0; i < nelem2; ++i) in parallel_sort()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/sort/parallel_stable_sort/ |
| H A D | parallel_stable_sort.hpp | 151 size_t nelem2 = nelem >> 1; in parallel_stable_sort() local
153 for (size_t i = 0; i < nelem2; ++i) in parallel_stable_sort()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/sort/parallel_stable_sort/ |
| H A D | parallel_stable_sort.hpp | 151 size_t nelem2 = nelem >> 1; in parallel_stable_sort() local
153 for (size_t i = 0; i < nelem2; ++i) in parallel_stable_sort()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/sort/parallel_stable_sort/ |
| H A D | parallel_stable_sort.hpp | 151 size_t nelem2 = nelem >> 1; in parallel_stable_sort() local
153 for (size_t i = 0; i < nelem2; ++i) in parallel_stable_sort()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/sort/parallel_stable_sort/ |
| H A D | parallel_stable_sort.hpp | 153 size_t nelem2 = nelem >> 1; in parallel_stable_sort() local
155 for (size_t i = 0; i < nelem2; ++i) in parallel_stable_sort()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/sort/parallel_stable_sort/ |
| H A D | parallel_stable_sort.hpp | 151 size_t nelem2 = nelem >> 1; in parallel_stable_sort() local
153 for (size_t i = 0; i < nelem2; ++i) in parallel_stable_sort()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/sort/parallel_stable_sort/ |
| H A D | parallel_stable_sort.hpp | 151 size_t nelem2 = nelem >> 1; in parallel_stable_sort() local
153 for (size_t i = 0; i < nelem2; ++i) in parallel_stable_sort()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/sort/parallel_stable_sort/ |
| H A D | parallel_stable_sort.hpp | 151 size_t nelem2 = nelem >> 1; in parallel_stable_sort() local
153 for (size_t i = 0; i < nelem2; ++i) in parallel_stable_sort()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/sort/parallel_stable_sort/ |
| H A D | parallel_stable_sort.hpp | 151 size_t nelem2 = nelem >> 1; in parallel_stable_sort() local
153 for (size_t i = 0; i < nelem2; ++i) in parallel_stable_sort()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/sort/block_indirect_sort/ |
| H A D | block_indirect_sort.hpp | 211 size_t nelem2 = nelem >> 1; in block_indirect_sort() local
213 for (size_t i = 0; i < nelem2; ++i) in block_indirect_sort()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/sort/block_indirect_sort/ |
| H A D | block_indirect_sort.hpp | 211 size_t nelem2 = nelem >> 1; in block_indirect_sort() local
213 for (size_t i = 0; i < nelem2; ++i) in block_indirect_sort()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/sort/block_indirect_sort/ |
| H A D | block_indirect_sort.hpp | 211 size_t nelem2 = nelem >> 1; in block_indirect_sort() local
213 for (size_t i = 0; i < nelem2; ++i) in block_indirect_sort()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/sort/block_indirect_sort/ |
| H A D | block_indirect_sort.hpp | 211 size_t nelem2 = nelem >> 1; in block_indirect_sort() local
213 for (size_t i = 0; i < nelem2; ++i) in block_indirect_sort()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/sort/block_indirect_sort/ |
| H A D | block_indirect_sort.hpp | 211 size_t nelem2 = nelem >> 1; in block_indirect_sort() local
213 for (size_t i = 0; i < nelem2; ++i) in block_indirect_sort()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/sort/block_indirect_sort/ |
| H A D | block_indirect_sort.hpp | 211 size_t nelem2 = nelem >> 1; in block_indirect_sort() local
213 for (size_t i = 0; i < nelem2; ++i) in block_indirect_sort()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/sort/block_indirect_sort/ |
| H A D | block_indirect_sort.hpp | 211 size_t nelem2 = nelem >> 1; in block_indirect_sort() local
213 for (size_t i = 0; i < nelem2; ++i) in block_indirect_sort()
|