/dports/science/xtb/xtb-6.4.1/src/ |
H A D | prmat.f90 | 27 integer :: n,ntimes,nrest,j,n2,k,i local 32 nrest=mod(norbs-istart+1,n) 46 if(nrest.gt.0.or.ntimes.eq.0) then 47 write(io,100)(i,i=j,j+nrest-1) 70 nrest=mod(norbs,n) 71 if(ntimes.eq.0) nrest=norbs 85 write(io,100)(i,i=j,j+nrest-1) 490 nrest=mod(norbs,n) 491 if(ntimes.eq.0) nrest=norbs 512 nrest=mod(norbs,n) [all …]
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/Netgen/libsrc/linalg/ |
H A D | linopt.cpp | 18 int nrest; in LinearOptimize() local 28 nrest = a.Height(); in LinearOptimize() 29 for (i1 = 1; i1 <= nrest; i1++) in LinearOptimize() 30 for (i2 = i1 + 1; i2 <= nrest; i2++) in LinearOptimize() 31 for (i3 = i2 + 1; i3 <= nrest; i3++) in LinearOptimize()
|
/dports/cad/netgen/netgen-6.2.2105/libsrc/linalg/ |
H A D | linopt.cpp | 18 int nrest; in LinearOptimize() local 28 nrest = a.Height(); in LinearOptimize() 29 for (i1 = 1; i1 <= nrest; i1++) in LinearOptimize() 30 for (i2 = i1 + 1; i2 <= nrest; i2++) in LinearOptimize() 31 for (i3 = i2 + 1; i3 <= nrest; i3++) in LinearOptimize()
|
/dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/netgen/libsrc/opti/ |
H A D | linopt.cpp | 18 int nrest; in LinearOptimize() local 28 nrest = a.Height(); in LinearOptimize() 29 for (i1 = 1; i1 <= nrest; i1++) in LinearOptimize() 30 for (i2 = i1 + 1; i2 <= nrest; i2++) in LinearOptimize() 31 for (i3 = i2 + 1; i3 <= nrest; i3++) in LinearOptimize()
|
/dports/math/fftw3-float/fftw-3.3.9/mpi/ |
H A D | rdft-rank-geq2-transposed.c | 119 INT nrest; in mkplan() local 146 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 158 nrest *= p->vn; in mkplan() 161 p->sz->dims[0].n, p->sz->dims[1].n, nrest, in mkplan() 168 INT is = p->sz->dims[0].n * nrest; in mkplan() 173 nrest, nrest), in mkplan() 175 nrest, 1, 1), in mkplan()
|
H A D | dft-rank-geq2-transposed.c | 122 INT nrest; in mkplan() local 153 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 165 nrest *= p->vn; in mkplan() 168 p->sz->dims[0].n, p->sz->dims[1].n, nrest * 2, in mkplan() 176 INT is = p->sz->dims[0].n * nrest * 2; in mkplan() 181 nrest * 2, nrest * 2), in mkplan() 183 nrest, 2, 2), in mkplan()
|
H A D | rdft2-rank-geq2-transposed.c | 155 INT nrest, n1, b1; in mkplan() local 204 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 218 nrest *= p->vn; in mkplan() 229 p->sz->dims[0].n, n1, nrest * 2, in mkplan() 236 n1, p->sz->dims[0].n, nrest * 2, in mkplan() 243 INT is = p->sz->dims[0].n * nrest * 2; in mkplan() 248 nrest * 2, nrest * 2), in mkplan() 250 nrest, 2, 2), in mkplan()
|
H A D | mpi-bench.c | 438 ptrdiff_t nrest = 1; in mkplan_complex() local 439 for (i = 2; i < rnk; ++i) nrest *= p->sz->dims[i].n; in mkplan_complex() 442 p->sz->dims[0].n, local_ni[1], vn * nrest, in mkplan_complex() 446 local_no[1], p->sz->dims[0].n, vn * nrest, in mkplan_complex() 531 ptrdiff_t nrest = 1; in mkplan_real() local 532 for (i = 2; i < rnk; ++i) nrest *= total_ni[i]; in mkplan_real() 535 total_ni[0], local_ni[1], vn * nrest, in mkplan_real() 539 local_no[1], total_ni[0], vn * nrest, in mkplan_real() 718 ptrdiff_t nrest = 1; in mkplan_r2r() local 722 p->sz->dims[0].n, local_ni[1], vn * nrest, in mkplan_r2r() [all …]
|
/dports/math/fftw3/fftw-3.3.9/mpi/ |
H A D | rdft-rank-geq2-transposed.c | 119 INT nrest; in mkplan() local 146 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 158 nrest *= p->vn; in mkplan() 161 p->sz->dims[0].n, p->sz->dims[1].n, nrest, in mkplan() 168 INT is = p->sz->dims[0].n * nrest; in mkplan() 173 nrest, nrest), in mkplan() 175 nrest, 1, 1), in mkplan()
|
H A D | dft-rank-geq2-transposed.c | 122 INT nrest; in mkplan() local 153 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 165 nrest *= p->vn; in mkplan() 168 p->sz->dims[0].n, p->sz->dims[1].n, nrest * 2, in mkplan() 176 INT is = p->sz->dims[0].n * nrest * 2; in mkplan() 181 nrest * 2, nrest * 2), in mkplan() 183 nrest, 2, 2), in mkplan()
|
H A D | rdft2-rank-geq2-transposed.c | 155 INT nrest, n1, b1; in mkplan() local 204 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 218 nrest *= p->vn; in mkplan() 229 p->sz->dims[0].n, n1, nrest * 2, in mkplan() 236 n1, p->sz->dims[0].n, nrest * 2, in mkplan() 243 INT is = p->sz->dims[0].n * nrest * 2; in mkplan() 248 nrest * 2, nrest * 2), in mkplan() 250 nrest, 2, 2), in mkplan()
|
/dports/math/fftw3-long/fftw-3.3.9/mpi/ |
H A D | rdft-rank-geq2-transposed.c | 119 INT nrest; in mkplan() local 146 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 158 nrest *= p->vn; in mkplan() 161 p->sz->dims[0].n, p->sz->dims[1].n, nrest, in mkplan() 168 INT is = p->sz->dims[0].n * nrest; in mkplan() 173 nrest, nrest), in mkplan() 175 nrest, 1, 1), in mkplan()
|
H A D | dft-rank-geq2-transposed.c | 122 INT nrest; in mkplan() local 153 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 165 nrest *= p->vn; in mkplan() 168 p->sz->dims[0].n, p->sz->dims[1].n, nrest * 2, in mkplan() 176 INT is = p->sz->dims[0].n * nrest * 2; in mkplan() 181 nrest * 2, nrest * 2), in mkplan() 183 nrest, 2, 2), in mkplan()
|
H A D | rdft2-rank-geq2-transposed.c | 155 INT nrest, n1, b1; in mkplan() local 204 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 218 nrest *= p->vn; in mkplan() 229 p->sz->dims[0].n, n1, nrest * 2, in mkplan() 236 n1, p->sz->dims[0].n, nrest * 2, in mkplan() 243 INT is = p->sz->dims[0].n * nrest * 2; in mkplan() 248 nrest * 2, nrest * 2), in mkplan() 250 nrest, 2, 2), in mkplan()
|
/dports/math/fftw3-quad/fftw-3.3.9/mpi/ |
H A D | rdft-rank-geq2-transposed.c | 119 INT nrest; in mkplan() local 146 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 158 nrest *= p->vn; in mkplan() 161 p->sz->dims[0].n, p->sz->dims[1].n, nrest, in mkplan() 168 INT is = p->sz->dims[0].n * nrest; in mkplan() 173 nrest, nrest), in mkplan() 175 nrest, 1, 1), in mkplan()
|
H A D | dft-rank-geq2-transposed.c | 122 INT nrest; in mkplan() local 153 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 165 nrest *= p->vn; in mkplan() 168 p->sz->dims[0].n, p->sz->dims[1].n, nrest * 2, in mkplan() 176 INT is = p->sz->dims[0].n * nrest * 2; in mkplan() 181 nrest * 2, nrest * 2), in mkplan() 183 nrest, 2, 2), in mkplan()
|
H A D | rdft2-rank-geq2-transposed.c | 155 INT nrest, n1, b1; in mkplan() local 204 nrest = 1; for (i = 1; i < sz->rnk; ++i) nrest *= sz->dims[i].n; in mkplan() 218 nrest *= p->vn; in mkplan() 229 p->sz->dims[0].n, n1, nrest * 2, in mkplan() 236 n1, p->sz->dims[0].n, nrest * 2, in mkplan() 243 INT is = p->sz->dims[0].n * nrest * 2; in mkplan() 248 nrest * 2, nrest * 2), in mkplan() 250 nrest, 2, 2), in mkplan()
|
/dports/science/libctl/libctl-4.5.0/utils/ |
H A D | nlopt.c | 52 int nrest = list_length(rest); in nlopt_minimize_scm() local 87 if (nrest >= 1) xtol_rel = scm_to_double(SCM_CAR(rest)); in nlopt_minimize_scm() 88 if (nrest >= 2) { in nlopt_minimize_scm() 98 if (nrest >= 3) maxeval = scm_to_int(scm_caddr(rest)); in nlopt_minimize_scm() 99 if (nrest >= 4) maxtime = scm_to_double(scm_cadddr(rest)); in nlopt_minimize_scm()
|
/dports/math/reduce/Reduce-svn5758-src/jlisp/android/AndroidReduce/src/uk/co/codemist/jlisp/ |
H A D | Fns.java | 177 int nvars = 0, nopts = -1, nrest = -1; in applyInner() local 189 for (;!b.atom;b = b.cdr) nrest++; in applyInner() 190 if (nrest > 1) Jlisp.error("may only have one &rest arg", bvl); in applyInner() 192 if (nrest < 0) nrest = 0; in applyInner() 194 if (nrest==0 && passed > total) in applyInner() 199 if (nrest != 0) in applyInner()
|
/dports/math/reduce/Reduce-svn5758-src/jlisp/core/ |
H A D | Fns.java | 201 int nvars = 0, nopts = -1, nrest = -1; in applyInner() local 213 for (;!b.atom;b = b.cdr) nrest++; in applyInner() 214 if (nrest > 1) Jlisp.error("may only have one &rest arg", bvl); in applyInner() 216 if (nrest < 0) nrest = 0; in applyInner() 218 if (nrest==0 && passed > total) in applyInner() 223 if (nrest != 0) in applyInner()
|
/dports/math/reduce/Reduce-svn5758-src/jslisp/src/java/org/mathpiper/mpreduce/functions/builtin/ |
H A D | Fns.java | 188 int nvars = 0, nopts = -1, nrest = -1; in applyInner() local 200 for (;!b.atom;b = b.cdr) nrest++; in applyInner() 201 if (nrest > 1) Jlisp.error("may only have one &rest arg", bvl); in applyInner() 203 if (nrest < 0) nrest = 0; in applyInner() 205 if (nrest==0 && passed > total) in applyInner() 210 if (nrest != 0) in applyInner()
|
/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/fistr1/tools/neu2fstr/HECD/ |
H A D | CFSTRDB_Solver.cpp | 28 nrest = 10; in Clear() 43 hecd->WriteData("III", nier, iterPREmax, nrest); in Write() 86 if (!hecd->ReadData(rcode, "III", &nier, &iterPREmax, &nrest)) return true; in Read()
|
/dports/science/xtb/xtb-6.4.1/src/prog/ |
H A D | thermo.f90 | 149 integer :: ntimes, nrest, i, j, n2, k 151 nrest = mod(size(freq), nRows) 152 if (ntimes.eq.0) nrest = size(freq) 160 if (nrest.gt.0.or.ntimes.eq.0) then 161 write(unit,'("eigval :",3x,10f9.2)') (freq(i)*scale,i=j,j+nrest-1)
|
/dports/print/gutenprint/gutenprint-5.3.3/src/testpattern/ |
H A D | compress-checksums.in | 293 my ($nrest) = join("", @elts[4..$#elts]); 294 if ($nrest ne $rest) { 324 $nrest = join("", @elts[4..$#elts]); 325 if ($nrest ne $rest) { 376 my ($nrest) = join("", @elts[4..$#elts]); 377 if ($nrest ne $rest) {
|
/dports/print/gimp-gutenprint/gutenprint-5.3.3/src/testpattern/ |
H A D | compress-checksums.in | 293 my ($nrest) = join("", @elts[4..$#elts]); 294 if ($nrest ne $rest) { 324 $nrest = join("", @elts[4..$#elts]); 325 if ($nrest ne $rest) { 376 my ($nrest) = join("", @elts[4..$#elts]); 377 if ($nrest ne $rest) {
|