Home
last modified time | relevance | path

Searched refs:lcase (Results 1 – 25 of 1258) sorted by relevance

12345678910>>...51

/dports/cad/calculix/CalculiX/cgx_2.18/src/
H A DdataMesh.c173 …if ( (lcase[lc].nmax = (int *)realloc( (int *)lcase[lc].nmax, lcase[lc].ncomps * sizeof(int))) == … in calcDatasets()
175 …if ( (lcase[lc].nmin = (int *)realloc( (int *)lcase[lc].nmin, lcase[lc].ncomps * sizeof(int))) == … in calcDatasets()
187 …if ( (lcase[lc].menu = (int *)realloc((int *)lcase[lc].menu, lcase[lc].ncomps * sizeof(int))) == N… in calcDatasets()
395 lcase[lc].dat[j][node[i].nr]=lcase[lc].dat[0][node[i].nr]+lcase[lc].dat[1][node[i].nr]; in calcDatasets()
689 if(lcase[lc].dat[j][node[i].nr] > lcase[lc].max[j]) in calcDatasets()
691 lcase[lc].max[j]=lcase[lc].dat[j][node[i].nr]; in calcDatasets()
694 if(lcase[lc].dat[j][node[i].nr] < lcase[lc].min[j]) in calcDatasets()
696 lcase[lc].min[j]=lcase[lc].dat[j][node[i].nr]; in calcDatasets()
884lcase[lc].dat[comp][node[i].nr]=lcase[lc].dat[comp-1][node[i].nr]*lcase[stresslc].dat[6][node[i].n… in calcDatasets()
1080 lcase[lc].max[j]=lcase[lc].dat[j][node[i].nr]; in transformDatasets()
[all …]
H A DreadDuns.c57 lcase[lc].min[lcase[lc].ncomps-1]=MAXFLOAT; in calcAddEntitiesDuns()
70 lcase[lc].menu[lcase[lc].ncomps-1] = 1; in calcAddEntitiesDuns()
71 lcase[lc].ictype[lcase[lc].ncomps-1] = 1; in calcAddEntitiesDuns()
72 lcase[lc].icind1[lcase[lc].ncomps-1] = 0; in calcAddEntitiesDuns()
73 lcase[lc].icind2[lcase[lc].ncomps-1] = 0; in calcAddEntitiesDuns()
74 lcase[lc].iexist[lcase[lc].ncomps-1] = 0; in calcAddEntitiesDuns()
80lcase[lc].dat[lcase[lc].ncomps-1][node[i].nr]=sqrt( lcase[lc].dat[n][node[i].nr]*lcase[lc].dat[n][… in calcAddEntitiesDuns()
81 if(lcase[lc].dat[lcase[lc].ncomps-1][node[i].nr] > lcase[lc].max[lcase[lc].ncomps-1]) in calcAddEntitiesDuns()
83 lcase[lc].max[lcase[lc].ncomps-1]=lcase[lc].dat[lcase[lc].ncomps-1][node[i].nr]; in calcAddEntitiesDuns()
86 if(lcase[lc].dat[lcase[lc].ncomps-1][node[i].nr] < lcase[lc].min[lcase[lc].ncomps-1]) in calcAddEntitiesDuns()
[all …]
H A Drectcyl.c85 …r= lcase[lc].dat[0][node] *a[0][0] + lcase[lc].dat[1][node] *a[1][0] + lcase[lc].dat[2][node] *a[2… in cartcyl()
86 …t= lcase[lc].dat[0][node] *a[0][1] + lcase[lc].dat[1][node] *a[1][1] + lcase[lc].dat[2][node] *a[2… in cartcyl()
87 …z= lcase[lc].dat[0][node] *a[0][2] + lcase[lc].dat[1][node] *a[1][2] + lcase[lc].dat[2][node] *a[2… in cartcyl()
97 …b[0][0]= lcase[lc].dat[0][node] *a[0][0] +lcase[lc].dat[3][node] *a[1][0] +lcase[lc].dat[5][node] … in cartcyl()
98 …b[0][1]= lcase[lc].dat[0][node] *a[0][1] +lcase[lc].dat[3][node] *a[1][1] +lcase[lc].dat[5][node] … in cartcyl()
99 …b[0][2]= lcase[lc].dat[0][node] *a[0][2] +lcase[lc].dat[3][node] *a[1][2] +lcase[lc].dat[5][node] … in cartcyl()
100 …b[1][0]= lcase[lc].dat[3][node] *a[0][0] +lcase[lc].dat[1][node] *a[1][0] +lcase[lc].dat[4][node] … in cartcyl()
101 …b[1][1]= lcase[lc].dat[3][node] *a[0][1] +lcase[lc].dat[1][node] *a[1][1] +lcase[lc].dat[4][node] … in cartcyl()
128 …r= lcase[lc].dat[0][node] *a[0][0] + lcase[lc].dat[1][node] *a[0][1] + lcase[lc].dat[2][node] *a[0… in cylcart()
129 …t= lcase[lc].dat[0][node] *a[1][0] + lcase[lc].dat[1][node] *a[1][1] + lcase[lc].dat[2][node] *a[1… in cylcart()
[all …]
H A Dreadfrd.c41 for(i=0; i<lcase[nr].ncomps; i++) free(lcase[nr].dat[i]); in freeDataset()
45 lcase[nr].dat=NULL; in freeDataset()
49 for(i=0; i<lcase[nr].npheader; i++) free(lcase[nr].pheader[i]); in freeDataset()
1058 lcase[anz->l].max[i]=lcase[anz->l].dat[i][nodenr]; in readfrd()
1063 lcase[anz->l].min[i]=lcase[anz->l].dat[i][nodenr]; in readfrd()
1426 if(lcase[lc].ncomps<6) maxcomps=lcase[lc].ncomps; in readfrdblock()
1559 if(lcase[lc].dat[i][node[j].nr] > lcase[lc].max[i]) in readfrdblock()
1561 lcase[lc].max[i]=lcase[lc].dat[i][node[j].nr]; in readfrdblock()
1564 if(lcase[lc].dat[i][node[j].nr] < lcase[lc].min[i]) in readfrdblock()
1566 lcase[lc].min[i]=lcase[lc].dat[i][node[j].nr]; in readfrdblock()
[all …]
H A DreadIsaac.c53 … if ( (lcase[lc].nmax = (int *)realloc(lcase[lc].nmax , lcase[lc].ncomps * sizeof(int))) == NULL ) in calcAddEntitiesIsaac()
55 … if ( (lcase[lc].nmin = (int *)realloc(lcase[lc].nmin , lcase[lc].ncomps * sizeof(int))) == NULL ) in calcAddEntitiesIsaac()
57 … if ( (lcase[lc].max = (float *)realloc(lcase[lc].max, lcase[lc].ncomps * sizeof(float))) == NULL ) in calcAddEntitiesIsaac()
59 … if ( (lcase[lc].min = (float *)realloc( lcase[lc].min,lcase[lc].ncomps * sizeof(float))) == NULL ) in calcAddEntitiesIsaac()
61 …if ( (lcase[lc].dat = (float **)realloc(lcase[lc].dat, lcase[lc].ncomps * sizeof(float *))) == NUL… in calcAddEntitiesIsaac()
80 … if ( (lcase[lc].menu = (int *)realloc(lcase[lc].menu, lcase[lc].ncomps * sizeof(int))) == NULL ) in calcAddEntitiesIsaac()
82 …if ( (lcase[lc].ictype = (int *)realloc(lcase[lc].ictype, lcase[lc].ncomps * sizeof(int))) == NULL… in calcAddEntitiesIsaac()
84 …if ( (lcase[lc].icind1 = (int *)realloc(lcase[lc].icind1, lcase[lc].ncomps * sizeof(int))) == NULL… in calcAddEntitiesIsaac()
86 …if ( (lcase[lc].icind2 = (int *)realloc( lcase[lc].icind2,lcase[lc].ncomps * sizeof(int))) == NULL… in calcAddEntitiesIsaac()
88 …if ( (lcase[lc].iexist = (int *)realloc(lcase[lc].iexist, lcase[lc].ncomps * sizeof(int))) == NULL… in calcAddEntitiesIsaac()
[all …]
H A DreadNastran.c51 Datasets *lcase=NULL; in readNastran() local
318 …sscanf(rec_str,"%*d %*s %f %f %f",&lcase[anz->l].dat[0][n],&lcase[anz->l].dat[1][n],&lcase[anz->l]… in readNastran()
327 if(lcase[anz->l].dat[i][node[j].nr] > lcase[anz->l].max[i]) in readNastran()
329 lcase[anz->l].max[i]=lcase[anz->l].dat[i][node[j].nr]; in readNastran()
332 if(lcase[anz->l].dat[i][node[j].nr] < lcase[anz->l].min[i]) in readNastran()
334 lcase[anz->l].min[i]=lcase[anz->l].dat[i][node[j].nr]; in readNastran()
456 …%f %f %f",&lcase[anz->l].dat[0][n],&lcase[anz->l].dat[1][n],&lcase[anz->l].dat[2][n],&lcase[anz->l… in readNastran()
465 if(lcase[anz->l].dat[i][node[j].nr] > lcase[anz->l].max[i]) in readNastran()
467 lcase[anz->l].max[i]=lcase[anz->l].dat[i][node[j].nr]; in readNastran()
470 if(lcase[anz->l].dat[i][node[j].nr] < lcase[anz->l].min[i]) in readNastran()
[all …]
H A Dcgx.c630 … ("\n%d %s %f %s %s %s\n", lc+1, lcase[lc].dataset_name, lcase[lc].value, lcase[lc].dataset_text, in nodalDataset()
3332 if(lcase[i].step_number!=lcase[i-1].step_number) in createDatasetEntries()
3404 …sprintf (buffer,"%d %.8s %lf %s", lcase[mds[i]].step_number, lcase[mds[i]].dataset_name, lcase[mds… in createDatasetEntries()
3434 … sprintf (buffer,"%d %.8s %lf %s", i+1, lcase[i].name, lcase[i].value, lcase[i].dataset_text ); in createDatasetEntries()
3444 … sprintf (buffer,"%d %.8s %lf %s", i+1, lcase[i].name, lcase[i].value, lcase[i].dataset_text ); in createDatasetEntries()
4383 lcase[lc].max[i]=pow(lcase[lc].max[i],factor); in expdataset()
4384 lcase[lc].min[i]=pow(lcase[lc].min[i],factor); in expdataset()
4397 lcase[lc].max[e]=pow(lcase[lc].max[e],factor); in expdataset()
4398 lcase[lc].min[e]=pow(lcase[lc].min[e],factor); in expdataset()
4654 …%f %s %s %d\n", lc[0], lcase[lc[0]-1].dataset_name, lcase[lc[0]-1].value, lcase[lc[0]-1].dataset_t… in selectData()
[all …]
H A DuserFunction.c29 extern Datasets *lcase;
177 lcase[l].dat[e][node[n].nr]=abs(lcase[l].dat[e][node[n].nr]); in userFunction()
178 if (lcase[l].dat[e][node[n].nr] > lcase[l].max[e]) in userFunction()
179 { lcase[l].max[e]=lcase[l].dat[e][node[n].nr]; lcase[l].nmax[e]=node[n].nr;} in userFunction()
180 if (lcase[l].dat[e][node[n].nr] < lcase[l].min[e]) in userFunction()
181 { lcase[l].min[e]=lcase[l].dat[e][node[n].nr]; lcase[l].nmin[e]=node[n].nr;} in userFunction()
256 generateDataset(sum,&lcase,"dummy",4,lcase[l].value,"",1,1,""); in userFunction()
271 … (lcase[l].dat[8][node[n].nr]+lcase[l].dat[9][node[n].nr]+lcase[l].dat[10][node[n].nr])/3.; in userFunction()
275lcase[sum->l].dat[i+1][node[n].nr]=lcase[l].dat[i][node[n].nr]-lcase[sum->l].dat[0][node[n].nr]; in userFunction()
280 … { lcase[sum->l].max[i]=lcase[sum->l].dat[i][node[n].nr]; lcase[sum->l].nmax[i]=node[n].nr; } in userFunction()
[all …]
H A DreadFoam.c1058 if(lcase[anzx->l].dat[n][node[i].nr] > lcase[anzx->l].max[n]) in readFoam()
1060 lcase[anzx->l].max[n]=lcase[anzx->l].dat[n][node[i].nr]; in readFoam()
1063 if(lcase[anzx->l].dat[n][node[i].nr] < lcase[anzx->l].min[n]) in readFoam()
1065 lcase[anzx->l].min[n]=lcase[anzx->l].dat[n][node[i].nr]; in readFoam()
1088 lcase[anzx->l].value=lcase[anzx->l-1].value; in readFoam()
1096 lcase[anzx->l].step_number=lcase[anzx->l-1].step_number; in readFoam()
1155lcase[ds.u].dat[0][node[i].nr]*lcase[ds.u].dat[0][node[i].nr]+lcase[ds.u].dat[1][node[i].nr]*lcase in readFoam()
1170 if(lcase[anzx->l].dat[j][node[i].nr] > lcase[anzx->l].max[j]) in readFoam()
1172 lcase[anzx->l].max[j]=lcase[anzx->l].dat[j][node[i].nr]; in readFoam()
1175 if(lcase[anzx->l].dat[j][node[i].nr] < lcase[anzx->l].min[j]) in readFoam()
[all …]
H A Dwrite2frd.c218 for (i=0; i<lcase[nlc].npheader; i++) fprintf( handle1, "%s\n", lcase[nlc].pheader[i]); in write2frd()
221 if (lcase[nlc].irtype == 3) in write2frd()
224 printf (" 21C%s%12.4e\n", lcase[nlc].name, lcase[nlc].value); in write2frd()
226 printf (" 21C%s%12.5e\n", lcase[nlc].name, lcase[nlc].value); in write2frd()
275lcase[nlc].edat[0][elem[i].nr][j], lcase[nlc].edat[1][elem[i].nr][j], lcase[nlc].edat[2][elem[i].n… in write2frd()
280 else if (lcase[nlc].irtype == 1) in write2frd()
331 for(i=0; i<lcase[nlc].ncomps; i++ ) if(lcase[nlc].iexist[i]!=1) cnam++; in write2frd()
338 for (i=0; i<lcase[nlc].ncomps; i++ ) in write2frd()
343 …if(lcase[nlc].iexist[i]==1) sprintf (&buffer[13], "%5d%5d%5d%5d%5d", 1, lcase[nlc].ictype[i], lcas… in write2frd()
344 …intf (&buffer[13], "%5d%5d%5d%5d%5d", 1, lcase[nlc].ictype[i], lcase[nlc].icind1[i], lcase[nlc].ic… in write2frd()
[all …]
H A Dwrite2darwin.c200 if(compare( lcase[lc].name, "STRESS", 6) == 6) in write2darwin()
202 printf("step_number:%d\n", lcase[lc].step_number); in write2darwin()
203 …printf("write:%s ds:%d with SEFF set to entity:%s\n", lcase[lc].name, lc+1, lcase[lc].compName[sef… in write2darwin()
204 if(step_number_buf!=lcase[lc].step_number) in write2darwin()
207 step_number_buf=lcase[lc].step_number; in write2darwin()
221 lcase[lc].dat[0][node[i].nr],lcase[lc].dat[1][node[i].nr],lcase[lc].dat[2][node[i].nr], in write2darwin()
222lcase[lc].dat[3][node[i].nr],lcase[lc].dat[5][node[i].nr],lcase[lc].dat[4][node[i].nr],lcase[lc].d… in write2darwin()
227 …if(lc) { for (lct=lc-1; lct>=0; lct--) { if(lcase[lct].step_number!=lcase[lc].step_number) break; … in write2darwin()
229 while((lct<anz->l)&&(lcase[lct].step_number==lcase[lc].step_number)) in write2darwin()
231 …if( (compare( lcase[lct].name, "NDTEMP", 6) == 6)||( compare( lcase[lct].name, "TEMP", 4) == 4)||(… in write2darwin()
[all …]
H A Dwrite2aba.c285 if (lcase[lc].ncomps == 1) in write2aba()
300 … frc2 = (atof(lcase[lc].dataset_text)*atof(lcase[lc].dataset_text))/(atof(dat[2])*atof(dat[2])); in write2aba()
313 … frc2 = (atof(lcase[lc].dataset_text)*atof(lcase[lc].dataset_text))/(atof(dat[2])*atof(dat[2])); in write2aba()
325 …if( (compare( lcase[lc].name, "NDTEMP", 6) == 6)||( compare( lcase[lc].name, "TEMP", 4) == 4)||( c… in write2aba()
335 oldtime=(lcase[lc].value); in write2aba()
352 … frc2 = (atof(lcase[lc].dataset_text)*atof(lcase[lc].dataset_text))/(atof(dat[2])*atof(dat[2])); in write2aba()
372 oldtime=(lcase[lc].value); in write2aba()
373 … frc2 = (atof(lcase[lc].dataset_text)*atof(lcase[lc].dataset_text))/(atof(dat[2])*atof(dat[2])); in write2aba()
423 if(n>=lcase[lc].ncomps) continue; in write2aba()
424 fprintf (handle2, "** %s %s\n", lcase[lc].name,lcase[lc].compName[n] ); in write2aba()
[all …]
H A Dgraph.c66 extern Datasets *lcase;
202 if(j<lcase[lc].npheader); in param2D()
352 if(j<lcase[lc].npheader); in plot2D()
371 if (!lcase[lc].loaded) in plot2D()
381 lcase[lc].loaded=1; in plot2D()
448 for(j=0; j<(lcase[lc].ncomps); j++) free(lcase[lc].dat[j]); in plot2D()
449 free(lcase[lc].dat); in plot2D()
450 lcase[lc].dat=NULL; in plot2D()
451 lcase[lc].loaded=0; in plot2D()
478 while((lcase[dsNr[1]].name[j]!=' ')&&(lcase[dsNr[1]].name[j]!='\0')) in plot2D()
[all …]
H A Drenumberfrd.c11 static Datasets *lcase; in renumberfrd() local
20 lcase=*lptr; in renumberfrd()
42 if (!lcase[nlc].loaded) in renumberfrd()
44 if( readfrdblock(nlc, anz, node, lcase )==-1) in renumberfrd()
106 for (ncmp=0; ncmp<lcase[nlc].ncomps; ncmp++ ) in renumberfrd()
110 dat[node[i].nr]=lcase[nlc].dat[ncmp][node[i].nr] ; in renumberfrd()
112 …if ( (lcase[nlc].dat[ncmp] = (float *)realloc( (float *)lcase[nlc].dat[ncmp] ,(anz->nmax+1) * size… in renumberfrd()
119 lcase[nlc].dat[ncmp][i]=0.; in renumberfrd()
123 lcase[nlc].dat[ncmp][newnode[node[i].nr]]=dat[node[i].nr]; in renumberfrd()
147 *nptr = node; *eptr = elem; *lptr = lcase; in renumberfrd()
H A DcopyEntity.c301 lcase[lc].dat[j][ns]=lcase[lc].dat[j][nm]; in copyDatasetToNodes()
315 lcase[lc].dat[j][ns]=lcase[lc].dat[j][nm]; in copyDatasetToNodes()
346 lcase[lc].dat[j][ns]=lcase[lc].dat[j][nm]; in copyDatasetToNodes()
397 lcase[lc].dat[j][ns]=lcase[lc].dat[j][nm]; in copyDatasetToNodes()
416 lcase[lc].dat[j][ns]=lcase[lc].dat[j][nm]; in copyDatasetToNodes()
509 lcase[lc1].dat[j][ns] = ctl*lcase[lc1].dat[j][nm]-stl*lcase[lc2].dat[j][nm]; in copyDatasetToNodes()
510 lcase[lc2].dat[j][ns] = stl*lcase[lc1].dat[j][nm]+ctl*lcase[lc2].dat[j][nm]; in copyDatasetToNodes()
539 lcase[lc1].dat[j][ns] = ctl*lcase[lc1].dat[j][nm]-stl*lcase[lc2].dat[j][nm]; in copyDatasetToNodes()
540 lcase[lc2].dat[j][ns] = stl*lcase[lc1].dat[j][nm]+ctl*lcase[lc2].dat[j][nm]; in copyDatasetToNodes()
642 { lcase[lc].max[i]=lcase[lc].dat[i][node[j].nr]; lcase[lc].nmax[i]=node[j].nr;} in copyDatasetToNodes()
[all …]
/dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/
H A Dreadfrd.c53 for(i=0; i<lcase[nr].ncomps; i++) SFREE(lcase[nr].dat[i]); in freeDatasets()
61 for(i=0; i<lcase[nr].npheader; i++) SFREE(lcase[nr].pheader[i]); in freeDatasets()
1068 lcase[anz->l].max[i]=lcase[anz->l].dat[i][nodenr]; in readfrd()
1073 lcase[anz->l].min[i]=lcase[anz->l].dat[i][nodenr]; in readfrd()
1195 lcase[anz->l].max[i]=lcase[anz->l].dat[i][nodenr]; in readfrd()
1434 if(lcase[lc].ncomps<6) maxcomps=lcase[lc].ncomps; in readfrdblock()
1567 if(lcase[lc].dat[i][node[j].nr] > lcase[lc].max[i]) in readfrdblock()
1569 lcase[lc].max[i]=lcase[lc].dat[i][node[j].nr]; in readfrdblock()
1572 if(lcase[lc].dat[i][node[j].nr] < lcase[lc].min[i]) in readfrdblock()
1574 lcase[lc].min[i]=lcase[lc].dat[i][node[j].nr]; in readfrdblock()
[all …]
H A Dgetuncrackedresults.c43 Datasets *lcase=NULL; in getuncrackedresults() local
375 for(j=0;j<lcase[i].npheader;j++){ in getuncrackedresults()
387 if(*iglob<0) *sigma=(6.283185307*(double)lcase[i].value)*(6.283185307*(double)lcase[i].value); in getuncrackedresults()
417 for(j=0;j<lcase[i].npheader;j++){ in getuncrackedresults()
430 if(*iglob<0) *sigma=(6.283185307*(double)lcase[i].value)*(6.283185307*(double)lcase[i].value); in getuncrackedresults()
462 for(j=0;j<lcase[i].npheader;j++){ in getuncrackedresults()
474 if(*iglob<0) *sigma=(6.283185307*(double)lcase[i].value)*(6.283185307*(double)lcase[i].value); in getuncrackedresults()
509 for(j=0;j<lcase[i].npheader;j++){ in getuncrackedresults()
521 if(*iglob<0) *sigma=(6.283185307*(double)lcase[i].value)*(6.283185307*(double)lcase[i].value); in getuncrackedresults()
553 freeDatasets(lcase,j); in getuncrackedresults()
[all …]
H A Dgetglobalresults.c40 Datasets *lcase=NULL; in getglobalresults() local
418 for(j=0;j<lcase[i].npheader;j++){ in getglobalresults()
431 if(*iglob<0) *sigma=(6.283185307*(double)lcase[i].value)*(6.283185307*(double)lcase[i].value); in getglobalresults()
463 for(j=0;j<lcase[i].npheader;j++){ in getglobalresults()
477 if(*iglob<0) *sigma=(6.283185307*(double)lcase[i].value)*(6.283185307*(double)lcase[i].value); in getglobalresults()
511 for(j=0;j<lcase[i].npheader;j++){ in getglobalresults()
524 if(*iglob<0) *sigma=(6.283185307*(double)lcase[i].value)*(6.283185307*(double)lcase[i].value); in getglobalresults()
561 for(j=0;j<lcase[i].npheader;j++){ in getglobalresults()
574 if(*iglob<0) *sigma=(6.283185307*(double)lcase[i].value)*(6.283185307*(double)lcase[i].value); in getglobalresults()
604 freeDatasets(lcase,j); in getglobalresults()
[all …]
H A Dutempread.c36 Datasets *lcase=NULL; in utempread() local
73 readfrd( datin, anz, &node, &elem, &lcase, read_mode); in utempread()
89 for(j=0;j<lcase[i].npheader;j++){ in utempread()
90 if(strcmp1(&lcase[i].pheader[j][5],"PSTEP")==0){ in utempread()
91 strcpy1(text,&lcase[i].pheader[j][48],12); in utempread()
97 (strcmp1(lcase[i].name,"NDTEMP")==0)){ in utempread()
107 if(!read_mode && readfrdblock(loadcase, anz, node, lcase )==-1) in utempread()
117 t1[nodenr-1]=lcase[loadcase].dat[0][nodenr]; in utempread()
124 freeDatasets(lcase,j); in utempread()
126 SFREE(lcase);lcase=NULL; in utempread()
/dports/net-mgmt/irrtoolset/irrtoolset-release-5.1.3/src/rpsl/
H A Drpsl_item.cc98 buf = item->bufferize(buf, lcase); in bufferize()
132 Buffer *ItemINT::bufferize(Buffer *buf, bool lcase) const { in bufferize()
193 if (lcase) in bufferize()
207 if (lcase) in bufferize()
226 if (lcase) in bufferize()
334 if (lcase) in bufferize()
348 if (lcase) in bufferize()
374 if (lcase) in bufferize()
388 if (lcase) in bufferize()
402 if (lcase) in bufferize()
[all …]
/dports/science/siesta/siesta-4.1.5/Src/
H A Dm_char.f905 public :: lcase, ucase, ccase
13 pure function lcase(str) function
15 character(len=len(str)) :: lcase local
19 lcase = str
20 i = scan(lcase,upper)
23 ic = index(upper,lcase(i:i))
24 lcase(i:i) = lower(ic:ic)
25 ic = scan(lcase(i+1:),upper)
33 end function lcase
68 ccase = lcase(str)
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/NWints/texas/
H A Dshells.F99 common /lcases/ lcase local
203 if(lshelij.eq.1) lcase=2 ! lx/yz
204 if(lshelij.eq.2) lcase=3 ! xl/yz
205 if(lshelkl.eq.1) lcase=4 ! xy/lz
206 if(lshelkl.eq.2) lcase=5 ! xy/zl
209 if(lshelij.eq.3) lcase=6 ! ll/xy
210 if(lshelkl.eq.3) lcase=7 ! xy/ll
211 if(lcas2(1).eq.1) lcase=8 ! lx/ly
212 if(lcas2(2).eq.1) lcase=9 ! lx/yl
213 if(lcas2(3).eq.1) lcase=10 ! xl/ly
[all …]
/dports/science/nwchem-data/nwchem-7.0.2-release/src/NWints/texas/
H A Dshells.F99 common /lcases/ lcase
203 if(lshelij.eq.1) lcase=2 ! lx/yz
204 if(lshelij.eq.2) lcase=3 ! xl/yz
205 if(lshelkl.eq.1) lcase=4 ! xy/lz
206 if(lshelkl.eq.2) lcase=5 ! xy/zl
209 if(lshelij.eq.3) lcase=6 ! ll/xy
210 if(lshelkl.eq.3) lcase=7 ! xy/ll
211 if(lcas2(1).eq.1) lcase=8 ! lx/ly
212 if(lcas2(2).eq.1) lcase=9 ! lx/yl
213 if(lcas2(3).eq.1) lcase=10 ! xl/ly
[all …]
/dports/graphics/argyllcms/Argyll_V1.9.2/
H A DJamtop129 lcase = $(<:L) ;
130 libname = $(lcase) ;
142 if [ GLOB /usr/include$(subd) : $(lcase).h $(lcase)lib.h ]
143 || [ GLOB $(LOCALBASE)/include$(subd) : $(lcase).h $(lcase)lib.h ]
144 || [ GLOB /usr/include/x86_64-linux-gnu$(subd) : $(lcase).h $(lcase)lib.h ]
145 || [ GLOB /usr/include/i386-linux-gnu$(subd) : $(lcase).h $(lcase)lib.h ] {
146 if [ GLOB /usr/lib : lib$(lcase).so ] || [ GLOB /usr/lib : lib$(lcase).a ]
147 || [ GLOB $(LOCALBASE)/lib : lib$(lcase).so ] || [ GLOB /usr/local/lib : lib$(lcase).a ]
148 || [ GLOB /usr/lib64 : lib$(lcase).so ] || [ GLOB /usr/lib64 : lib$(lcase).a ]
156 LINKFLAGS += $(LINKFLAG)$(lcase) ;
[all …]
/dports/science/berkeleygw/BGW-2.0.0/MeanField/EPM/
H A DtagHandlerMod.f9046 integer :: ucase, lcase
54 private lcase
99 CUpperCase = char(mod(i,lcase) + int(i/lcase) * ucase)
193 lcase = ichar('a')
195 if(lcase .lt. ucase) then
197 error = lcase
198 lcase = ucase

12345678910>>...51