Home
last modified time | relevance | path

Searched refs:indexj (Results 1 – 16 of 16) sorted by relevance

/dports/science/octopus/octopus-10.5/src/grid/
H A Doperate_inc.c86 int indexj = (index[j] + i)<<ldf; variable
87 a0 = VEC_FMA(wj, LOAD(fi + indexj + k), a0);
88 a1 = VEC_FMA(wj, LOAD(fi + indexj + 1*VEC_SIZE + k), a1);
89 a2 = VEC_FMA(wj, LOAD(fi + indexj + 2*VEC_SIZE + k), a2);
90 a3 = VEC_FMA(wj, LOAD(fi + indexj + 3*VEC_SIZE + k), a3);
177 int indexj = (index[j] + i)<<ldf; variable
231 int indexj = (index[j] + i)<<ldf; variable
267 int indexj = (index[j] + i)<<ldf; variable
295 int indexj = (index[j] + i)<<ldf; variable
316 int indexj = (index[j] + i)<<ldf; variable
[all …]
/dports/math/csdp/Csdp-releases-6.2.0/lib/
H A Dsortentries.c8 int indexj; member
22 if (((struct entry *)p1)->indexj < ((struct entry *)p2)->indexj) in mycompare()
26 if (((struct entry *)p1)->indexj == ((struct entry *)p2)->indexj) in mycompare()
30 if (((struct entry *)p1)->indexj > ((struct entry *)p2)->indexj) in mycompare()
108 entries[j-1].indexj=ptr->jindices[j];
126 ptr->jindices[j]=entries[j-1].indexj;
H A Dreadprob.c42 int indexj; local
372 (indexj < 1) || (indexj > pC->blocks[blkno].blocksize))
376 matno,blkno,indexi,indexj,ent);
586 if ((indexi != indexj) && (ent != 0.0))
603 printf("indexj=%d\n",indexj);
633 printf("indexj=%d\n",indexj);
944 int indexj;
954 if (indexi > indexj)
957 indexi=indexj;
958 indexj=itemp;
[all …]
H A Dreadsol.c23 int indexj; local
84 ret=fscanf(fid,"%d %d %d %d %le",&matno,&blkno,&indexi,&indexj,&ent);
89 matno,blkno,indexi,indexj,ent);
102 pZ->blocks[blkno].data.mat[ijtok(indexi,indexj,pZ->blocks[blkno].blocksize)]=ent;
103 pZ->blocks[blkno].data.mat[ijtok(indexj,indexi,pZ->blocks[blkno].blocksize)]=ent;
118 pX->blocks[blkno].data.mat[ijtok(indexi,indexj,pX->blocks[blkno].blocksize)]=ent;
119 pX->blocks[blkno].data.mat[ijtok(indexj,indexi,pX->blocks[blkno].blocksize)]=ent;
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bvpl/
H A Dbvpl_direction_to_color_map.cxx85 int indexj=-1; in find_closest_points_from_cube_to_peano_curve() local
93 indexj=j; in find_closest_points_from_cube_to_peano_curve()
98 if (indexj==0) // first point in find_closest_points_from_cube_to_peano_curve()
100 vgl_line_3d_2_points<double> l1(peano_curve[indexj],peano_curve[indexj+1]); in find_closest_points_from_cube_to_peano_curve()
103 double length=(peano_curve[indexj+1]-peano_curve[indexj]).length(); in find_closest_points_from_cube_to_peano_curve()
108 vgl_line_3d_2_points<double> l2(peano_curve[indexj-1],peano_curve[indexj]); in find_closest_points_from_cube_to_peano_curve()
111 double length=index_to_length[indexj]-index_to_length[indexj-1]; in find_closest_points_from_cube_to_peano_curve()
116 vgl_line_3d_2_points<double> l1(peano_curve[indexj],peano_curve[indexj+1]); in find_closest_points_from_cube_to_peano_curve()
117 vgl_line_3d_2_points<double> l2(peano_curve[indexj-1],peano_curve[indexj]); in find_closest_points_from_cube_to_peano_curve()
125 double length=(peano_curve[indexj+1]-peano_curve[indexj]).length(); in find_closest_points_from_cube_to_peano_curve()
[all …]
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/volumetricMesh/
H A DgenerateMassMatrix.cpp63 int indexj = volumetricMesh->getVertexIndex(el,j); in computeMassMatrix() local
64 massMatrixOutline->AddEntry(3*indexi+0, 3*indexj+0, entry); in computeMassMatrix()
65 massMatrixOutline->AddEntry(3*indexi+1, 3*indexj+1, entry); in computeMassMatrix()
66 massMatrixOutline->AddEntry(3*indexi+2, 3*indexj+2, entry); in computeMassMatrix()
/dports/math/csdp/Csdp-releases-6.2.0/matlab/
H A Dreadsol.m153 indexj=A(4,i);
162 % [blk, indexi, indexj, K.s(blk)]
164 z(vecsdpbase(blk)+indexi+(indexj-1)*blocksizes(blk)-1)=ent;
165 z(vecsdpbase(blk)+indexj+(indexi-1)*blocksizes(blk)-1)=ent;
173 indexj=A(4,i);
182 x(vecsdpbase(blk)+indexi+(indexj-1)*blocksizes(blk)-1)=ent;
183 x(vecsdpbase(blk)+indexj+(indexi-1)*blocksizes(blk)-1)=ent;
/dports/science/siesta/siesta-4.1.5/Src/
H A Datomlwf.F112 . i,ia,imu,in,index,indexa,indexb,indexi,indexj,iorb,is,j,ja, local
530 indexj = ( ( nelectr + 2 ) / 2 )
539 indexj = ( ( nelectr / 2 ) )
544 nhij = nhij + indexj
/dports/science/dalton/dalton-66052b3af5ea7225e31178bf9a8b031913c72190/DALTON/amfi/
H A Dsymtra.F230 indexj=ifirstLM(jlval,jmval,jcent)+ncount(jrun)-1
231 laufalt=ipnt(indexi,indexj)
236 if (indexi.gt.indexj) then
/dports/math/gfan/gfan0.6.2/src/
H A Dbuchberger.cpp449 int indexj=0; in buchberger2() local
450 for(PolynomialSet::iterator j=g->begin();j!=g->end();j++,indexj++) in buchberger2()
453 sPolynomials.updatePairs(G,indexj); in buchberger2()
505 sPolynomials.updatePairs(G,indexj);//,truncationDegree,&grading); in buchberger2()
507 indexj++; in buchberger2()
/dports/math/gfanlib/gfan0.6.2/src/
H A Dbuchberger.cpp449 int indexj=0; in buchberger2() local
450 for(PolynomialSet::iterator j=g->begin();j!=g->end();j++,indexj++) in buchberger2()
453 sPolynomials.updatePairs(G,indexj); in buchberger2()
505 sPolynomials.updatePairs(G,indexj);//,truncationDegree,&grading); in buchberger2()
507 indexj++; in buchberger2()
/dports/science/dynare/dynare-4.6.4/matlab/
H A Didentification_checks_via_subsets.m327 indexj=nchoosek(int16(indtotparam),j); % int16 speeds up nchoosek
333 indexj_dDYNAMIC = RemoveProblematicParameterSets(indexj,dynamic_problpars);
339 indexj_dREDUCEDFORM = RemoveProblematicParameterSets(indexj,reducedform_problpars);
345 indexj_dMOMENTS = RemoveProblematicParameterSets(indexj,moments_problpars);
351 indexj_dSPECTRUM = RemoveProblematicParameterSets(indexj,spectrum_problpars);
357 indexj_dMINIMAL = RemoveProblematicParameterSets(indexj,minimal_problpars);
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/pspw/lib/sic/
H A Dpspw_sic.F696 integer indexi,indexj
841 indexj = (j-1 + (ms-1)*ne(1))*n2ft3d
843 > dbl_mb(rhoi(1)+indexj),
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/pspw/lib/sic/
H A Dpspw_sic.F696 integer indexi,indexj
841 indexj = (j-1 + (ms-1)*ne(1))*n2ft3d
843 > dbl_mb(rhoi(1)+indexj),
/dports/math/R-cran-Matching/Matching/src/
H A Dscythematrix.cc337 int indexi, indexj; in operator ()() local
343 indexj = static_cast < int > (J.data[j]); in operator ()()
347 if (indexj >= colsize || indexj < 0) { in operator ()()
350 newdata.data[place] = data[indexi * colsize + indexj]; in operator ()()
/dports/math/latte-integrale/latte-version_1_7_6/code/maple/
H A Dm-knapsack.mpl910 mmu:=proc(L,i,j) local out,L1,L2,indexi,newL,indexj;#L is a list of common divisor
918 if member(j,newL,'s')=true then indexj:=s;fi;
919 out:=-add(mmu(newL,newL[k],newL[indexj]),k=1..nops(newL));