Home
last modified time | relevance | path

Searched refs:knum (Results 1 – 25 of 210) sorted by relevance

123456789

/dports/math/sisl/SISL-SISL-4.6.0-44-g9114631/src/
H A Ds1017.c203 kj1 = knum;
205 kj2 = knum;
212 knum++;
216 knum = 0;
219 knum++;
223 knum = 0;
226 knum++;
243 st[knum] = apar;
245 memcopy (st + knum + 1, pc->et + knum, kn + kk - knum, double);
255 if (knum < kn1)
[all …]
H A Ds1711.c229 if ((s1[knum] < apar ) && DNEQUAL(s1[knum], apar))
230 kj1=knum; else kj2=knum;
231 knum = (kj1+kj2)/2;
237 apar = s1[knum];
238 knum++;
247 knum = 0;
250 knum++;
255 knum = kn+kk-1;
258 knum--;
262 kn1 = knum + kv - kk;
[all …]
H A Ds1710.c279 if ((s1[knum] < apar) && DNEQUAL (s1[knum], apar))
280 kj1=knum;
282 kj2=knum;
283 knum = (kj1+kj2)/2;
290 apar = s1[knum];
291 knum++;
298 knum = 0;
301 knum++;
306 knum = kn+kk-1;
309 knum--;
[all …]
H A Ds1231.c260 knum = (kj1+kj2)/2;
261 while (knum != kj1)
263 if ((s1[knum] < apar) && DNEQUAL (s1[knum], apar))
264 kj1=knum; else kj2=knum;
265 knum = (kj1+kj2)/2;
272 apar = s1[knum];
273 knum++;
280 kn1 = knum + kv - kk;
281 kn2 = kn + kk - knum;
321 knum -= kk - 1;
[all …]
H A Dsh1992.c150 else knum = kdim;
200 else knum = kdim;
219 if (knum == 9)
222 else if (knum == 4)
244 else knum = kdim;
264 if (knum == 9)
268 else if (knum == 4)
367 else knum = kdim;
396 if (knum == 9)
500 else knum = kdim;
[all …]
H A Dshmkhlppts.c108 int knum = 0; /* Number of intpt on edges. */ local
154 knum = 0;
156 knum = vedge[0]->ipoint;
159 knum += vedge[1]->ipoint;
162 if (knum > 0)
164 sh6edgpoint (vedge, &up, &knum, &kstat);
169 if (knum == 2)
174 knum = 0;
177 if (knum == 0) /* BOH & ALA Added: 200993 */
208 for (; ki < knum; ki++ )
H A Dshcheckput.c123 int knum; /* Number of points transmitted. */ local
165 for (ki=0,knum=0; ki<pintdat->ipoint; ki++)
179 uintpt[knum] = newIntpt(kant,spar,pintdat->vpoint[ki]->adist);
180 perm_arr[ki] = knum;
181 knum++;
186 if (knum == 0) goto out;
190 for (ki=0; ki<knum; ki++)
215 *jstat = knum;
H A Ds6idkpt.c106 int knum; local
126 for (knum = -1,ki=0; ki<(*pintdat)->ipoint; ki++)
129 knum = ki;
139 if (knum == -1)
143 (*pintdat)->vpoint[knum] = (*pintdat)->vpoint[(*pintdat)->ipoint-1];
H A Ds6idklist.c100 int ki,knum,kstat; local
118 for (ki=0,knum = -1; ki < (*pintdat)->ilist; ki++)
121 knum = ki;
125 if (knum == -1)
146 (*pintdat)->vlist[knum] = (*pintdat)->vlist[(*pintdat)->ilist-1];
H A Dsh6idkpt.c110 int knum; local
213 for (knum = -1, ki = 0; ki < (*pintdat)->ipoint; ki++)
217 knum = ki;
223 if (knum == -1)
227 (*pintdat)->vpoint[knum] = (*pintdat)->vpoint[(*pintdat)->ipoint - 1];
H A Ds1162.c325 knum = (kdiv<3 ? 2:4);
371 for (ki=0;ki<knum;ki+=1)
953 up[knum]=qintpt;
954 knum++;
964 if (knum > 0 )
982 else if (knum < 2 )
1051 *jnum = knum;
1221 for (kj=0,knum=0;kj<vedge[0]->iedge&&knum<3;kj++)
1232 up[knum]=qintpt;
1233 knum++;
[all …]
H A Dconstruct.c224 knum = 12;
226 knum = 4;
228 knum = idim;
1889 int knum; local
1921 if (pcurve->idim == 3) knum = 9;
1922 else if (pcurve->idim == 2) knum = 4;
1923 else knum = pcurve->idim;
2024 int knum; local
2059 if (psurf->idim == 3) knum = 9;
2060 else if (psurf->idim == 2) knum = 4;
[all …]
H A Ds6newbox.c103 int knum = (inum == 1) ? inum : 2*inum; /* If the geometry space has local
114 if ((pbox->e2min[itype] = newarray(knum,DOUBLE)) == SISL_NULL) goto err101;
115 if ((pbox->e2max[itype] = newarray(knum,DOUBLE)) == SISL_NULL) goto err101;
H A Dspli_silh.c114 int knum=0; /* No of points in crv to split. */ local
140 knum = (*pintdat)->vlist[ki]->inumb;
156 knum > 3)
198 if (knum > 2)
204 if (ac_no >= knum) goto errinconsis;
260 (*pintdat)->vlist[klist]->inumb = knum + 1 - ac_no;
/dports/audio/supercollider/SuperCollider-3.11.0-Source/SCClassLibrary/Common/Audio/
H A DGendyn.sc5 …ram=1.0, minfreq=440, maxfreq=660, ampscale= 0.5, durscale=0.5, initCPs= 12, knum, mul=1.0,add=0.0;
6 …durdist, adparam, ddparam, minfreq, maxfreq, ampscale, durscale, initCPs, knum ? initCPs).madd( mu…
9 …aram=1.0, minfreq=20, maxfreq=1000, ampscale= 0.5, durscale=0.5, initCPs= 12, knum,mul=1.0,add=0.0;
10 …durdist, adparam, ddparam, minfreq, maxfreq, ampscale, durscale, initCPs, knum ? initCPs).madd( mu…
17 …=1.0, minfreq=440, maxfreq=660, ampscale= 0.5, durscale=0.5, initCPs= 12, knum, a=1.17, c=0.31, mu…
18 …durdist, adparam, ddparam, minfreq, maxfreq, ampscale, durscale, initCPs, knum ? initCPs, a, c).ma…
22 …durdist, adparam, ddparam, minfreq, maxfreq, ampscale, durscale, initCPs, knum ? initCPs, a, c).ma…
29 …dparam=1.0, ddparam=1.0, freq=440, ampscale= 0.5, durscale=0.5, initCPs= 12, knum, mul=1.0,add=0.0;
30 …', ampdist, durdist, adparam, ddparam, freq, ampscale, durscale, initCPs, knum ? initCPs).madd( mu…
33 …dparam=1.0, ddparam=1.0, freq=440, ampscale= 0.5, durscale=0.5, initCPs= 12, knum, mul=1.0,add=0.0;
[all …]
/dports/audio/csound/csound-6.15.0/Opcodes/
H A Dgendy.c141 knum = (int32_t)*p->knum; in kgendy()
149 if (knum > p->points || knum < 1) in kgendy()
192 knum = (int32_t)*p->knum; in agendy()
206 if (knum > p->points || knum < 1) in agendy()
273 knum = (int32_t)*p->knum; in kgendyx()
281 if (knum > p->points || knum < 1) in kgendyx()
327 knum = (int32_t)*p->knum; in agendyx()
341 if (knum > p->points || knum < 1) in agendyx()
416 knum = (int32_t)*p->knum; in kgendyc()
424 if (knum > p->points || knum < 1) in kgendyc()
[all …]
/dports/graphics/flam3/flam3-3.1.1-5-g7fb50c8/
H A Dfilters.c174 if (knum==0) in flam3_spatial_filter()
176 else if (knum==1) in flam3_spatial_filter()
178 else if (knum==2) in flam3_spatial_filter()
180 else if (knum==3) in flam3_spatial_filter()
182 else if (knum==4) in flam3_spatial_filter()
184 else if (knum==5) in flam3_spatial_filter()
186 else if (knum==6) in flam3_spatial_filter()
188 else if (knum==7) in flam3_spatial_filter()
190 else if (knum==8) in flam3_spatial_filter()
192 else if (knum==9) in flam3_spatial_filter()
[all …]
/dports/math/igraph/igraph-0.9.5/vendor/glpk/misc/
H A Dmc21a.c193 void ranmat(int m, int n, int icn[], int iptr[], int nnnp1, int *knum,
202 int i, iold, j, j1, j2, jj, knum, l, licn, n, nov4, num, numnz; in main() local
210 knum = l * n; in main()
212 if (knum > licn) goto L10; in main()
217 ranmat(n, n, icn, ip, n+1, &knum, iw1); in main()
219 if (knum > licn) goto L10; in main()
220 xprintf("n = %2d; nz = %4d; sing = %d\n", n, knum, sing); in main()
250 void ranmat(int m, int n, int icn[], int iptr[], int nnnp1, int *knum, in ranmat() argument
254 inum = (*knum / n) * 2; in ranmat()
280 *knum = matnum - 1; in ranmat()
/dports/math/glpk/glpk-5.0/src/misc/
H A Dmc21a.c193 void ranmat(int m, int n, int icn[], int iptr[], int nnnp1, int *knum,
202 int i, iold, j, j1, j2, jj, knum, l, licn, n, nov4, num, numnz; in main() local
210 knum = l * n; in main()
212 if (knum > licn) goto L10; in main()
217 ranmat(n, n, icn, ip, n+1, &knum, iw1); in main()
219 if (knum > licn) goto L10; in main()
220 xprintf("n = %2d; nz = %4d; sing = %d\n", n, knum, sing); in main()
250 void ranmat(int m, int n, int icn[], int iptr[], int nnnp1, int *knum, in ranmat() argument
254 inum = (*knum / n) * 2; in ranmat()
280 *knum = matnum - 1; in ranmat()
/dports/audio/praat/praat-6.2.03/external/glpk/
H A Dglpnet01.c193 void ranmat(int m, int n, int icn[], int iptr[], int nnnp1, int *knum,
202 int i, iold, j, j1, j2, jj, knum, l, licn, n, nov4, num, numnz;
210 knum = l * n;
212 if (knum > licn) goto L10;
217 ranmat(n, n, icn, ip, n+1, &knum, iw1);
219 if (knum > licn) goto L10;
220 xprintf("n = %2d; nz = %4d; sing = %d\n", n, knum, sing);
250 void ranmat(int m, int n, int icn[], int iptr[], int nnnp1, int *knum,
254 inum = (*knum / n) * 2;
280 *knum = matnum - 1;
/dports/biology/bbmap/bbmap/current/jgi/
H A DKmerCountMulti.java307 for(int knum=0; knum<numK; knum++){
310 sum+=mlog.counters[knum].cardinality();
312 tsw.print(mlogArray[0].counters[knum].k+"\t"+((sum+ways-1)/ways)+"\n");
329 for(int knum=0; knum<numK; knum++){
330 counts[knum][way]=mlog.counters[knum].cardinality();
334 for(int knum=0; knum<numK; knum++){
335 long[] array=counts[knum];
340 int k=mlogArray[0].counters[knum].k;
/dports/net/tinyfugue/tf-50b8/os2/
H A Dtf-keys.cmd34 knum = C2D(Arg(1))
35 IF ((knum >= 0) & (knum <= 31)) | (knum >= 127) THEN
/dports/net/tinyfugue-devel/tinyfugue-5.1.3/os2/
H A Dtf-keys.cmd34 knum = C2D(Arg(1))
35 IF ((knum >= 0) & (knum <= 31)) | (knum >= 127) THEN
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-outlier/src/main/java/de/lmu/ifi/dbs/elki/algorithm/outlier/lof/
H A DKDEOS.java199 final int knum = kmax + 1 - kmin; in estimateDensities() local
202 densities.put(iter, new double[knum]); in estimateDensities()
270 final int knum = kmax + 1 - kmin; in computeOutlierScores() local
273 double[][] scratch = new double[knum][kmax + 5]; in computeOutlierScores()
281 scratch = new double[knum][neighbors.size() + 5]; in computeOutlierScores()
287 for(int k = 0; k < knum; k++) { in computeOutlierScores()
295 for(int i = 0; i < knum; i++) { in computeOutlierScores()
305 score /= knum; // average in computeOutlierScores()
/dports/science/berkeleygw/BGW-2.0.0/Common/
H A Dread_cube.f9046 integer :: i,j,k,k0,k1,k2,jerr,knum,na,ngrid(3) local
104 knum=FFTgrid(3)/6
106 knum=FFTgrid(3)/6+1
116 do k=1,knum

123456789