/dports/math/sisl/SISL-SISL-4.6.0-44-g9114631/src/ |
H A D | s1386.c | 271 kn2 = 0; 280 kn2++; 299 kn2++; 330 for (kl=0; kl<kn2; kl++) 350 if (in != kn2) goto error; 355 for (kj=0; kj<kn2; kj++) 360 indx2 = kl*kn2*rdim; 384 kn2 = ps -> in2; 402 kn2 = qc2 -> in; 410 scoef = newarray((kn1*kn2 + kn2*ider1)*(ps->idim),DOUBLE); [all …]
|
H A D | s1956.c | 113 int kn2; /* Number of vertices of second curve. */ local 140 kn2 = pc2 -> in; 181 for (s0=ssurf,s2=scoef2,kj=0; kj<kn2; s2+=(kdim+1),kj++) 200 if ((*rsurf = newSurf(kn1,kn2,kk1,kk2,pc1->et,pc2->et, 214 if ((ssurf = newarray(kn1*kn2*kdim,double)) == SISL_NULL) goto err101; 218 for (s0=ssurf,s2=scoef2,kj=0; kj<kn2; s2+=kdim,kj++) 225 if ((*rsurf = newSurf(kn1,kn2,kk1,kk2,pc1->et,pc2->et, 234 if (kn1 != kn2 || kk1 != kk2) kstat = 0; 259 if (kn1 != kn2 || kk1 != kk2) kstat = 0; 260 tdist = s6dist(scoef1,scoef2+(kn2-1)*newdim,newdim); [all …]
|
H A D | s1387.c | 113 int kn2; /* Order in second parameter direction */ local 128 kn2 = ps->in2; 168 kn2 = qc2->in; 169 st2 = newarray (kk2 + kn2, DOUBLE); 173 memcopy (st2, qc2->et, kk2 + kn2, DOUBLE); 177 scoef = newarray (kn1 * kn2 * rdim, DOUBLE); 184 s6chpar (qc2->ecoef, kn1, kn2, rdim, scoef); 189 kdim = kn2 * rdim; 218 scoef = increasearray (scoef, kn1 * kn2 * rdim, DOUBLE); 222 s6chpar (qc4->ecoef, kn2, kn1, rdim, scoef); [all …]
|
H A D | sh1994.c | 100 int kk1, kk2, kn1, kn2; local 118 kn2 = s1->in2; 119 kbez = (kk1 == kn1) && (kk2 == kn2); 123 if ((kk1 == 2 && kn1 == 2) || (kk2 == 2 && kn2 == 2)) goto out; 131 for (kj=0, scoef=s1->ecoef; kj<kn2; kj++,scoef=s1->ecoef+kn1*kj) 155 for (tdiff=DZERO, kj=1, scoef=s1->ecoef+ki; kj<kn2; kj+=kh, scoef+=kh*kn1) 157 for (kh=1; kj+kh<=kn2; kh++) 168 if (kj+kh > kn2) break;
|
H A D | s1329.c | 112 int kn1,kn2; /* Number of coefficients of surface. */ local 136 kn2 = psold -> in2; 149 for(i=idim; i< kn1*kn2*idimp1; i+=idimp1) 155 if ((sc = newarray(idimp1*kn1*kn2,DOUBLE)) == SISL_NULL) goto err101; 156 for(i=0; i< kn1*kn2*idimp1; i++) 170 if ((scoef = newarray(kdim*kn1*kn2,DOUBLE)) == SISL_NULL) goto err101; 174 for (s1=scoef,s2=s1+kn1*kn2; s1<s2; s1++) 202 *rsnew = newSurf(kn1,kn2,kk1,kk2,psold->et1,psold->et2,scoef,1,kdim,1);
|
H A D | s1332.c | 113 int kn2; /* Number of vertices of curve 2. */ local 156 kn2 = pc2 -> in; 164 scoef = newarray(kn1*kn2*rdim,DOUBLE); 166 scoef = newarray(kn1*kn2*kdim,DOUBLE); 179 weight2 = newarray(kn2,DOUBLE); 182 for (ki=0; ki<kn2; ki++) 185 for (ki=0; ki<kn2; ki++) 191 for (kj=0; kj<kn2; kj++) 225 *rs = newSurf(kn1,kn2,kord1,kord2,sknot1,sknot2,scoef,kind,kdim,kcopy);
|
H A D | s1839.c | 108 int kn1,kn2; /* Number of vertices in each parameter local 126 kn2 = ps1 -> in2; 144 for (s1=sdir,s2=s1+idim,s3=scoef,s4=scoef+idim*(kn1*kn2-1); s1<s2; 152 for (s1=sdir+idim,s2=s1+idim,s3=scoef+idim*kn1*(kn2-1), 181 for (s1=sdir+6*idim,s2=s1+idim,s3=scoef+idim*kn1*(kn2-1);s1<s2;s1++,s3++) 190 for (s1=sdir+8*idim,s2=s1+idim,s3=scoef+idim*(kn1*kn2-1);s1<s2;s1++,s3++) 201 s1834(scoef,kn1*kn2,epol,in,idim,sdir,sdir+idim,&kstat); 207 s1834(scoef,kn1*kn2,epol,in,idim,sdir+idim,sdir,&kstat); 219 s1834(scoef,kn1*kn2,epol,in,idim,sdir+ki*idim,sdir+(ki+1)*idim,&kstat);
|
H A D | s1328.c | 112 int kn1,kn2; /* Number of coefficients of surface. */ local 137 kn2 = psold -> in2; 150 for(i=idim; i< kn1*kn2*idimp1; i+=idimp1) 156 if ((sc=newarray(kn1*kn2*idimp1,DOUBLE)) == SISL_NULL) goto err101; 158 for(i=0; i< kn1*kn2*idimp1; i++) 172 if ((scoef = newarray(kdim*kn1*kn2,double)) == SISL_NULL) goto err101; 176 for (s1=scoef,s2=s1+kdim*kn1*kn2; s1<s2; s1+=2) 208 *rsnew = newSurf(kn1,kn2,kk1,kk2,psold->et1,psold->et2,scoef,1,kdim,1);
|
H A D | make3D.c | 99 int kk1,kk2,kn1,kn2; /* Orders and numbers of vertices */ local 115 kn2 = ps -> in2; 122 if((s3coef = newarray(kn1*kn2*3,DOUBLE)) == SISL_NULL) goto err101; 147 for (kj=0,sq=sp ; kj<kn2 ; kj++,sq+=kincre) *sq = tsum; 157 for (ki=0,sp=s3coef+1 ; ki< kn2 ; ki++) 174 for (kj=0,sp=s3coef+2,sq=scoef ; kj < kn2 ; kj++) 180 if(((*rsnew) = newSurf(kn1,kn2,kk1,kk2,st1,st2,s3coef,1,3,1)) == SISL_NULL) goto err101;
|
H A D | s1994.c | 95 int kk1, kk2, kn1, kn2; local 114 kn2 = s1->in2; 115 kbez = (kk1 == kn1) && (kk2 == kn2); 119 if ((kk1 == 2 && kn1 == 2) || (kk2 == 2 && kn2 == 2)) goto out; 125 for (kj = 0, scoef = s1->ecoef;kj < kn2; kj++,scoef++) 136 for (kj = 1 , scoef = s1->ecoef + ki; kj < kn2; kj++, scoef +=kn1 )
|
H A D | s1830.c | 107 int kn1,kn2; /* Number of vertices of surface. */ local 136 kn2 = psurf->in2; 145 s6diff(ssurf+(kn1*kn2-1)*kdim,ssurf,kdim,sdiag1); 147 s6diff(ssurf+kn1*(kn2-1)*kdim,ssurf+(kn1-1)*kdim,kdim,sdiag2); 155 s1834(ssurf,kn1*kn2,scurve,knc,kdim,stan,snorm,&kstat); 162 s1834(ssurf,kn1*kn2,scurve,knc,kdim,snorm,stan,&kstat);
|
H A D | s1711.c | 124 int kn1,kn2; /* Number of vertices in the new surfaces.*/ local 263 kn2 = kn + kk - knum; 269 if ((st2=newarray(kn2+kk,double))==SISL_NULL) goto err101; 272 if ((scoef2=newarray(kn2*kdim*knsec,double))==SISL_NULL) goto err101; 277 memcopy(st2+kk,st+knum,kn2,double); 292 memcopy(scoef2+ki*kdim*kn2,scoef+kdim*(ki*kn+knum-kk), 293 kdim*kn2,double); 299 kdim*kn2*knsec,double); 363 k2m=kdim*kn2; 364 k3m=kdim*kn2*knsec; [all …]
|
H A D | s1921.c | 141 int kn1,kn2; /* Number of vertices of surface. */ local 178 kn2 = qkreg -> in2; 190 if ( (sc = newarray(2*kn1*kn2, DOUBLE)) == SISL_NULL ) goto err101; 195 for ( s1=scoef, s2=sc, sstop=s2+2*kn1*kn2; s2 < sstop; s1+=idim+1, s2+=2 ) 206 if ( (sc = newarray(kn1*kn2, DOUBLE)) == SISL_NULL ) goto err101; 210 for ( s1=scoef, s2=sc, sstop=s2+kn1*kn2; s2 < sstop; s1+=idim, s2++ ) 217 qs = newSurf(kn1, kn2, kk1, kk2, st1, st2, sc, qkreg->ikind, 1, 1);
|
H A D | s1715.c | 125 int kn2=pc2->in; /* Number of vertices in the old curves. */ local 214 kn2=pc2->in; 222 while (pc2->et[kn2+kk-1-km2] == pc2->et[kn2+kk-1]) km2++; 228 while (pc2->et[kn2+kk-1-km2end] == pc2->et[kn2+kk-1]) km2end++; 233 kn = kn1 + kn2 + 3*kk - km1 - km2 - km2end -1; 296 tdel = pc2->et[kn2+kk-1] + s1[-1]; 301 for (s3=pc2->et+kn2+kk-km2-1; s1<s2; s1++,s3--) *s1 =tdel- *s3; 374 stran[ki] = iend2? pc2->ecoef[kdim*(kn2-max(0,km2-kk)-1)+ki]: 389 s3=pc2->ecoef+kdim*(kn2-max(0,km2-kk)-1); 391 s3=pc2->rcoef+routdim*(kn2-max(0,km2-kk)-1);
|
H A D | shdivsurf.c | 136 int kn2; /* Number of vertices in 2. par. dir. */ local 183 kn2 = ps->in2; 200 kn2 = ps->in2; 211 if ((qc1 = newCurve (kn2, ps->ik2, st2, scoef2, kkind, kn1 * kdim, 0)) 226 kn2 = qc3->in; 235 if ((*rsnew = newSurf (kn1, kn2, kk1, kk2, st1, st2,
|
H A D | s1425.c | 264 int kn1,kn2; /* The number of B-splines accociated with the knot local 320 kn2 = ps1 -> in2; 345 if (kn1 < kk1 || kn2 < kk2) goto err116; 351 if (st2[kk2-1] == st2[kk2] || st2[kn2-1] == st2[kn2]) goto err117; 404 s1219(st2,kk2,kn2,&kleft2,epar[1],&kstat); 408 if (st2[kn2] == epar[1]) 412 kmult = s6knotmult(st2,kk2,kn2,&kleft2,epar[1],&kstat); 420 kn = kn2;
|
H A D | s1025.c | 121 int kn2; /* Number of vertices in 2. par. dir. */ local 183 kn2 = ps->in2; 198 kn2 = ps->in2; 209 if ((qc1 = newCurve (kn2, ps->ik2, st2, scoef2, 1, kn1 * kdim, 0)) 225 kn2 = qc3->in; 234 if ((*rsnew = newSurf (kn1, kn2, ps->ik1, ps->ik2, st1, st2,
|
H A D | s1302.c | 123 int kn2; /* Number of vertice of input curve */ local 160 kn2 = pc -> in; 178 for (ki=0;ki<kn2;ki++) 223 sucof = newarray(kn1*kn2*kdim,DOUBLE); 228 for (ki=0;ki<kn2;ki++) 244 *rs = newSurf(kn1,kn2,kk1,kk2,st1,st2,sucof,1,kdim,1);
|
/dports/audio/tuxguitar/tuxguitar-src-1.2/TuxGuitar-tuner/src/craigl/spectrumanalyzer/ |
H A D | FFT.java | 68 int n, n2, i, k, kn2, l, p; in doFFT() local 80 kn2 = k + n2; in doFFT() 85 tr = xr[kn2] * c + xi[kn2] * s; in doFFT() 86 ti = xi[kn2] * c - xr[kn2] * s; in doFFT() 88 xr[kn2] = xr[k] - tr; in doFFT() 89 xi[kn2] = xi[k] - ti; in doFFT()
|
/dports/lang/gcc6-aux/gcc-6-20180516/libjava/classpath/gnu/xml/transform/ |
H A D | XSLComparator.java | 97 double kn2 = Expr._number(n2, k2); in compare() local 99 if (Double.isNaN(kn1) || Double.isInfinite(kn2)) in compare() 103 else if (Double.isNaN(kn2) || Double.isInfinite(kn1)) in compare() 110 d = (kn1 > kn2) ? 1 : (kn1 < kn2) ? -1 : 0; in compare()
|
/dports/lang/gcc48/gcc-4.8.5/libjava/classpath/gnu/xml/transform/ |
H A D | XSLComparator.java | 97 double kn2 = Expr._number(n2, k2); in compare() local 99 if (Double.isNaN(kn1) || Double.isInfinite(kn2)) in compare() 103 else if (Double.isNaN(kn2) || Double.isInfinite(kn1)) in compare() 110 d = (kn1 > kn2) ? 1 : (kn1 < kn2) ? -1 : 0; in compare()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libjava/classpath/gnu/xml/transform/ |
H A D | XSLComparator.java | 97 double kn2 = Expr._number(n2, k2); in compare() local 99 if (Double.isNaN(kn1) || Double.isInfinite(kn2)) in compare() 103 else if (Double.isNaN(kn2) || Double.isInfinite(kn1)) in compare() 110 d = (kn1 > kn2) ? 1 : (kn1 < kn2) ? -1 : 0; in compare()
|
/dports/lang/gnat_util/gcc-6-20180516/libjava/classpath/gnu/xml/transform/ |
H A D | XSLComparator.java | 97 double kn2 = Expr._number(n2, k2); in compare() local 99 if (Double.isNaN(kn1) || Double.isInfinite(kn2)) in compare() 103 else if (Double.isNaN(kn2) || Double.isInfinite(kn1)) in compare() 110 d = (kn1 > kn2) ? 1 : (kn1 < kn2) ? -1 : 0; in compare()
|
/dports/devel/mingw32-gcc/gcc-4.8.1/libjava/classpath/gnu/xml/transform/ |
H A D | XSLComparator.java | 97 double kn2 = Expr._number(n2, k2); in compare() local 99 if (Double.isNaN(kn1) || Double.isInfinite(kn2)) in compare() 103 else if (Double.isNaN(kn2) || Double.isInfinite(kn1)) in compare() 110 d = (kn1 > kn2) ? 1 : (kn1 < kn2) ? -1 : 0; in compare()
|
/dports/java/sablevm-classpath/sablevm-classpath-1.13/gnu/xml/transform/ |
H A D | XSLComparator.java | 102 double kn2 = Expr._number(n2, k2); in compare() local 104 if (Double.isNaN(kn1) || Double.isInfinite(kn2)) in compare() 108 else if (Double.isNaN(kn2) || Double.isInfinite(kn1)) in compare() 115 d = (kn1 > kn2) ? 1 : (kn1 < kn2) ? -1 : 0; in compare()
|