| /dports/science/siesta/siesta-4.1.5/Util/Contrib/APostnikov/ |
| H A D | intpl04.f | 19 integer mesh01,mesh02,mesh03,nrela(3),inear(3),id(3),
28 xx = drela - float(inear)
42 igrid0(1) = modulo(nrela(1)+inear(1)-1,mesh01)+1
43 igrid0(2) = modulo(nrela(2)+inear(2)-1,mesh02)+1
44 igrid0(3) = modulo(nrela(3)+inear(3)-1,mesh03)+1
46 igrid1(2) = modulo(nrela(2)+inear(2)-1,mesh02)+1
47 igrid1(3) = modulo(nrela(3)+inear(3)-1,mesh03)+1
48 igrid2(1) = modulo(nrela(1)+inear(1)-1,mesh01)+1
50 igrid2(3) = modulo(nrela(3)+inear(3)-1,mesh03)+1
51 igrid3(1) = modulo(nrela(1)+inear(1)-1,mesh01)+1
[all …]
|
| /dports/science/lammps/lammps-stable_29Sep2021/src/ |
| H A D | compute_cna_atom.cpp | 226 for (inear = 0; inear < nnearest[i]; inear++) in compute_peratom()
261 for (inear = 0; inear < nnearest[i]; inear++) in compute_peratom()
318 for (inear = 0; inear < 12; inear++) { in compute_peratom()
319 cj = cna[inear][NCOMMON]; in compute_peratom()
320 ck = cna[inear][NBOND]; in compute_peratom()
321 cl = cna[inear][MAXBOND]; in compute_peratom()
322 cm = cna[inear][MINBOND]; in compute_peratom()
332 for (inear = 0; inear < 14; inear++) { in compute_peratom()
333 cj = cna[inear][NCOMMON]; in compute_peratom()
334 ck = cna[inear][NBOND]; in compute_peratom()
[all …]
|
| /dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/src/ |
| H A D | compute_cna_atom.cpp | 262 for (inear = 0; inear < nnearest[i]; inear++) in compute_peratom()
297 for (inear = 0; inear < nnearest[i]; inear++) in compute_peratom()
354 for (inear = 0; inear < 12; inear++) { in compute_peratom()
355 cj = cna[inear][NCOMMON]; in compute_peratom()
356 ck = cna[inear][NBOND]; in compute_peratom()
357 cl = cna[inear][MAXBOND]; in compute_peratom()
358 cm = cna[inear][MINBOND]; in compute_peratom()
368 for (inear = 0; inear < 14; inear++) { in compute_peratom()
369 cj = cna[inear][NCOMMON]; in compute_peratom()
370 ck = cna[inear][NBOND]; in compute_peratom()
[all …]
|
| /dports/science/lammps/lammps-stable_29Sep2021/src/EXTRA-COMPUTE/ |
| H A D | compute_cnp_atom.cpp | 133 int i,j,k,ii,jj,kk,m,n,inum,jnum,inear,jnear; in compute_peratom() local
243 for (inear = 0; inear < nnearest[i]; inear++) in compute_peratom()
245 if (nearest[i][inear] == nearest[j][jnear]) { in compute_peratom()
246 if (ncommon < MAXCOMMON) common[ncommon++] = nearest[i][inear]; in compute_peratom()
276 for (inear = 0; inear < nnearest[i]; inear++) in compute_peratom()
278 if (nearest[i][inear] == onenearest[jnear]) { in compute_peratom()
279 if (ncommon < MAXCOMMON) common[ncommon++] = nearest[i][inear]; in compute_peratom()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bsgm/ |
| H A D | bsgm_remove_spikes.cxx | 202 int inear = 0, jnear = 0; in expand_input_img() local
210 if (i >= 0 && i <= (ni - 1)) inear = i; in expand_input_img()
211 else if (i < 0) inear = 0; in expand_input_img()
212 else if (i > (ni - 1)) inear = (ni - 1); in expand_input_img()
213 float v = input_img_(inear, jnear); in expand_input_img()
|
| /dports/games/gnubg/gnubg-1.06.002/ |
| H A D | osr.c | 131 unsigned int ifar, inear, iboth; in FindBestMoveOSR2() local
137 inear = 5 + anDice[1]; in FindBestMoveOSR2()
139 if (anBoard[ifar] && anBoard[inear]) { in FindBestMoveOSR2()
146 --anBoard[inear]; in FindBestMoveOSR2()
|
| /dports/finance/R-cran-fBasics/fBasics/man/ |
| H A D | matrix-rk.Rd | 44 The rank of a matrix is also named inear map.
|
| /dports/math/spooles/spooles.2.2/Eigen/doc/ |
| H A D | abstract.tex | 3 {\bf SP}arse {\bf O}bject {\bf O}riented {\bf L}inear
|
| /dports/math/spooles/spooles.2.2/LinSol/doc/ |
| H A D | abstract.tex | 3 {\bf SP}arse {\bf O}bject {\bf O}riented {\bf L}inear
|
| /dports/math/spooles-mpich/spooles.2.2/LinSol/doc/ |
| H A D | abstract.tex | 3 {\bf SP}arse {\bf O}bject {\bf O}riented {\bf L}inear
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/Eigen/doc/ |
| H A D | abstract.tex | 3 {\bf SP}arse {\bf O}bject {\bf O}riented {\bf L}inear
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/LinSol/doc/ |
| H A D | abstract.tex | 3 {\bf SP}arse {\bf O}bject {\bf O}riented {\bf L}inear
|
| /dports/math/spooles-mpich/spooles.2.2/Eigen/doc/ |
| H A D | abstract.tex | 3 {\bf SP}arse {\bf O}bject {\bf O}riented {\bf L}inear
|
| /dports/math/spooles/spooles.2.2_SHARED/Eigen/doc/ |
| H A D | abstract.tex | 3 {\bf SP}arse {\bf O}bject {\bf O}riented {\bf L}inear
|
| /dports/math/spooles/spooles.2.2_SHARED/LinSol/doc/ |
| H A D | abstract.tex | 3 {\bf SP}arse {\bf O}bject {\bf O}riented {\bf L}inear
|
| /dports/math/lemon/lemon-1.3.1/doc/ |
| H A D | references.bib | 102 title = {{GLPK} -- {GNU} {L}inear {P}rogramming {K}it},
108 title = {{Clp} -- {Coin-Or} {L}inear {P}rogramming},
|
| /dports/editors/texstudio/texstudio-4.1.2/completion/ |
| H A D | tikzducks.cwl | 93 inear=#%color
|
| /dports/science/tinker/tinker/source/ |
| H A D | volume.f | 536 integer inear(maxarc) local
629 inear(nnear) = j
684 in = inear(k)
|
| /dports/biology/protomol/protomol/doc/HGroup/ |
| H A D | hgroup.bbl | 6 {L}inear analysis and applications to {N}ewtonian and {L}angevin dynamics.
|
| /dports/devel/upp/upp/bazaar/STEM4U/src.tpp/ |
| H A D | TSP_TavellingSalesman_en-us.tpp | 20 inear programming][2 . Because of that, for practical reasons,
|
| /dports/math/clp/Clp-1.17.3/ |
| H A D | README.md | 3 Clp (*C*oin-or *l*inear *p*rogramming) is an open-source linear programming solver.
|
| /dports/math/spooles/spooles.2.2/documentation/ReferenceManual/ |
| H A D | temp.tex | 75 {\bf O}bject-{\bf O}riented {\bf L}inear {\bf E}quations {\bf S}olver.
|
| /dports/math/spooles-mpich/spooles.2.2/documentation/ReferenceManual/ |
| H A D | temp.tex | 75 {\bf O}bject-{\bf O}riented {\bf L}inear {\bf E}quations {\bf S}olver.
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/documentation/ReferenceManual/ |
| H A D | temp.tex | 75 {\bf O}bject-{\bf O}riented {\bf L}inear {\bf E}quations {\bf S}olver.
|
| /dports/math/spooles/spooles.2.2_SHARED/documentation/ReferenceManual/ |
| H A D | temp.tex | 75 {\bf O}bject-{\bf O}riented {\bf L}inear {\bf E}quations {\bf S}olver.
|