Home
last modified time | relevance | path

Searched refs:minr (Results 1 – 25 of 272) sorted by relevance

1234567891011

/dports/math/xspread/xspread-3.1.1c.orig/
H A Dutils.c148 doirr(minr, minc, maxr, maxc) in doirr() argument
149 int minr, minc, maxr, maxc; in doirr()
182 dorlirr(minr, minc, maxr, maxc) in dorlirr() argument
183 int minr, minc, maxr, maxc; in dorlirr()
245 int minr, minc, maxr, maxc; in valid_nrange()
253 for (; minr <= maxr && minc <= maxc; minr += rinc, minc += cinc) {
254 p = *ATBL(tbl, minr, minc);
275 int minr, minc, maxr, maxc; in set_step()
280 if (minr == maxr)
304 int minr, minc, maxr, maxc;
[all …]
H A Dinterp.c810 if (minr>maxr) r = maxr, maxr = minr, minr = r;
841 if (minr>maxr) r = maxr, maxr = minr, minr = r;
1294 if (minr>maxr) r = maxr, maxr = minr, minr = r;
1925 if (minr>maxr) r = maxr, maxr = minr, minr = r;
1928 if (minr < 0) minr = 0;
1976 if (minr>maxr) r = maxr, maxr = minr, minr = r;
1979 if (minr < 0) minr = 0;
2004 if (minr>maxr) r = maxr, maxr = minr, minr = r;
2007 if (minr < 0) minr = 0;
2154 if (minr>maxr) r = maxr, maxr = minr, minr = r;
[all …]
H A Drange.c31 int minr,minc,maxr,maxc; local
36 minr = left.vp->row; minrf = left.vf & FIX_ROW;
39 minr = right.vp->row; minrf = right.vf & FIX_ROW;
51 left.vp = lookat(minr, minc);
77 rcp = lookat(minr,minc-1);
99 int minr,minc,maxr,maxc; local
101 minr = left->row < right->row ? left->row : right->row;
106 left = lookat(minr, minc);
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/voro++/src/
H A Dv_base.cc30 double xlo,ylo,zlo,xhi,yhi,zhi,minr,*radp=mrad; in voro_base() local
34 minr=large_number; in voro_base()
41 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i-1,j,k); in voro_base()
42 if((f&b1)==0) compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i+1,j,k); in voro_base()
45 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j-1,k); in voro_base()
46 if((f&b3)==0) compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j+1,k); in voro_base()
49 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j,k-1); in voro_base()
55 radp[q]=minr; in voro_base()
60 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j,k); in voro_base()
63 *radp=minr; in voro_base()
[all …]
/dports/cad/gds3d/GDS3D-bcdb97a/libgdsto3d/voro++/src/
H A Dv_base.cc30 double xlo,ylo,zlo,xhi,yhi,zhi,minr,*radp=mrad; in voro_base() local
34 minr=large_number; in voro_base()
41 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i-1,j,k); in voro_base()
42 if((f&b1)==0) compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i+1,j,k); in voro_base()
45 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j-1,k); in voro_base()
46 if((f&b3)==0) compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j+1,k); in voro_base()
49 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j,k-1); in voro_base()
55 radp[q]=minr; in voro_base()
60 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j,k); in voro_base()
63 *radp=minr; in voro_base()
[all …]
/dports/science/voro++/voro++-0.4.6/src/
H A Dv_base.cc30 double xlo,ylo,zlo,xhi,yhi,zhi,minr,*radp=mrad; in voro_base() local
34 minr=large_number; in voro_base()
41 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i-1,j,k); in voro_base()
42 if((f&b1)==0) compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i+1,j,k); in voro_base()
45 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j-1,k); in voro_base()
46 if((f&b3)==0) compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j+1,k); in voro_base()
49 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j,k-1); in voro_base()
55 radp[q]=minr; in voro_base()
60 compute_minimum(minr,xlo,xhi,ylo,yhi,zlo,zhi,i,j,k); in voro_base()
63 *radp=minr; in voro_base()
[all …]
/dports/math/sc/sc-7.16/
H A Dsort.c35 int minr, minc, maxr, maxc, r, c; in sortrange() local
40 minr = left->row < right->row ? left->row : right->row; in sortrange()
46 rows = (int *)scxmalloc((maxr - minr + 1) * sizeof(int)); in sortrange()
47 for (r = minr, c = 0; r <= maxr; r++, c++) in sortrange()
100 qsort(rows, maxr - minr + 1, sizeof(int), compare); in sortrange()
101 erase_area(minr, minc, maxr, maxc, 1); in sortrange()
105 for (c = 0; c <= maxr - minr && rows[c] != p->row; c++) ; in sortrange()
106 if (c > maxr - minr) { in sortrange()
111 p->row = minr + c; in sortrange()
119 currow = minr; in sortrange()
H A Dinterp.c830 if (minr>maxr) r = maxr, maxr = minr, minr = r; in eval()
869 if (minr>maxr) r = maxr, maxr = minr, minr = r; in eval()
1331 if (minr>maxr) r = maxr, maxr = minr, minr = r; in seval()
2145 if (minr>maxr) r = maxr, maxr = minr, minr = r; in fill()
2148 if (minr < 0) minr = 0; in fill()
2193 if (minr>maxr) r = maxr, maxr = minr, minr = r; in lock_cells()
2196 if (minr < 0) minr = 0; in lock_cells()
2220 if (minr>maxr) r = maxr, maxr = minr, minr = r; in unlock_cells()
2223 if (minr < 0) minr = 0; in unlock_cells()
2393 if (minr>maxr) r = maxr, maxr = minr, minr = r; in format_cell()
[all …]
/dports/math/sc-im/sc-im-0.8.2/src/
H A Dsort.c80 int minr, minc, maxr, maxc, r, c; in sortrange() local
84 minr = left->row < right->row ? left->row : right->row; in sortrange()
92 rows = (int *) scxmalloc((maxr - minr + 1) * sizeof(int)); in sortrange()
93 for (r = minr, c = 0; r <= maxr; r++, c++) in sortrange()
153 qsort(rows, maxr - minr + 1, sizeof(int), compare); in sortrange()
158 yank_area(minr, minc, maxr, maxc, 's', 1); // save yanklist in the original range in sortrange()
166 for (c = 0; c <= maxr - minr && rows[c] != p_aux->row; c++) ; in sortrange()
167 if (c > maxr - minr) { in sortrange()
172 p_aux->row = minr + c; in sortrange()
175 currow = minr; in sortrange()
H A Dinterp.c1166 if (minr>maxr) r = maxr, maxr = minr, minr = r; in eval()
1218 if (minr>maxr) r = maxr, maxr = minr, minr = r; in eval()
1873 if (minr>maxr) r = maxr, maxr = minr, minr = r; in seval()
2433 if (minr>maxr) r = maxr, maxr = minr, minr = r; in fill()
2436 if (minr < 0) minr = 0; in fill()
2496 if (minr>maxr) r = maxr, maxr = minr, minr = r; in lock_cells()
2499 if (minr < 0) minr = 0; in lock_cells()
2537 if (minr>maxr) r = maxr, maxr = minr, minr = r; in unlock_cells()
2540 if (minr < 0) minr = 0; in unlock_cells()
2786 if (minr>maxr) r = maxr, maxr = minr, minr = r; in format_cell()
[all …]
H A Dinterp.h47 char * dostindex(int minr, int minc, int maxr, int maxc, struct enode * val);
48 double doindex(int minr, int minc, int maxr, int maxc, struct enode * val);
49 double dolookup(struct enode * val, int minr, int minc, int maxr, int maxc, int offset, int vflag);
50 double docount(int minr, int minc, int maxr, int maxc, struct enode * e);
51 double dosum(int minr, int minc, int maxr, int maxc, struct enode * e);
52 double doprod(int minr, int minc, int maxr, int maxc, struct enode * e);
53 double doavg(int minr, int minc, int maxr, int maxc, struct enode * e);
54 double dostddev(int minr, int minc, int maxr, int maxc, struct enode * e);
55 double domax(int minr, int minc, int maxr, int maxc, struct enode * e);
56 double domin(int minr, int minc, int maxr, int maxc, struct enode * e);
H A Dfilter.c109 int minr = left->row < right->row ? left->row : right->row; in enable_filters() local
114 results = (int *) scxrealloc((char *) results, (maxr - minr + 3) * sizeof(int)); in enable_filters()
115 results[0] = minr; // keep in first position the first row of the range! in enable_filters()
123 for (r = minr; r <= maxr; r++) { in enable_filters()
124 results[r-minr+2] = 0; // show row by default (0 = NOT HIDDEN) in enable_filters()
145 … results[r-minr+2] = 1; // this row does not eval to expression. we hide it. (1 = HIDDEN)! in enable_filters()
/dports/games/openra/OpenRA-release-20200503/mods/ra/audio/
H A Dnotifications.yaml41 FourtyMinutesRemaining: 40minr
94 TenMinutesRemaining: 10minr
96 ThirtyMinutesRemaining: 30minr
100 TwentyMinutesRemaining: 20minr
110 WarningOneMinuteRemaining: 1minr
111 WarningTwoMinutesRemaining: 2minr
112 WarningThreeMinutesRemaining: 3minr
113 WarningFourMinutesRemaining: 4minr
114 WarningFiveMinutesRemaining: 5minr
/dports/games/stonesoup/crawl-0.27.1/crawl-ref/source/
H A Drandom-pick.h23 int minr; member
58 if (level < pop.minr || level > pop.maxr) in pick()
95 if (level < pop.minr || level > pop.maxr) in probability_at()
121 int len = pop.maxr - pop.minr; in rarity_at()
132 return rar * (len - abs(pop.minr + pop.maxr - 2 * depth)) in rarity_at()
137 return rar * (len - abs(pop.minr + pop.maxr - 2 * depth)) in rarity_at()
141 return rar * (depth - pop.minr + 1) / (len + 1); in rarity_at()
/dports/audio/csound/csound-6.15.0/Opcodes/
H A Dpvsdemix.c71 if (p->minr.auxp==NULL || p->minr.size<M) in pvsdemix_init()
72 csound->AuxAlloc(csound, M, &p->minr); in pvsdemix_init()
103 float *minr = (float *) p->minr.auxp; in pvsdemix_process() local
129 minl[n] = minr[n] = FLOATMAX_; in pvsdemix_process()
144 minr[n] = (minr[n] < right[n+(imax - i)] ? in pvsdemix_process()
145 minr[n] : right[n+(imax - i)]); in pvsdemix_process()
152 right[n+i] = (right[n+i] == minr[n] ? in pvsdemix_process()
153 maxr[n] - minr[n] : 0.f); in pvsdemix_process()
/dports/www/libecap/libecap-1.0.1/src/libecap/common/
H A Dversion.h15 majr(majr_), minr(minr_), micr(micr_) {} in majr()
20 majr == v.majr && minr == v.minr && micr == v.micr; }
26 int minr; variable
/dports/astro/pykep/pykep-2.6/src/third_party/cspice/
H A Dzzlatbox.c19 doublereal diag[3], midr, minr, maxr, minz, maxz; in zzlatbox_() local
213 minr = bounds[4]; in zzlatbox_()
266 inrad = cos(maxlat) * minr; in zzlatbox_()
269 inrad = cos(minlat) * minr; in zzlatbox_()
274 inrad = cos((max(d__1,d__2))) * minr; in zzlatbox_()
308 minz = minr * sin(minlat); in zzlatbox_()
310 maxz = minr * sin(maxlat); in zzlatbox_()
H A Dzzdsksgr.c23 doublereal minr; in zzdsksgr_() local
422 minr = dskdsc[20]; in zzdsksgr_()
423 if (minr <= 0.) { in zzdsksgr_()
426 errdp_("*", &minr, (ftnlen)1); in zzdsksgr_()
/dports/astro/py-pykep/pykep-2.6/src/third_party/cspice/
H A Dzzlatbox.c19 doublereal diag[3], midr, minr, maxr, minz, maxz; in zzlatbox_() local
213 minr = bounds[4]; in zzlatbox_()
266 inrad = cos(maxlat) * minr; in zzlatbox_()
269 inrad = cos(minlat) * minr; in zzlatbox_()
274 inrad = cos((max(d__1,d__2))) * minr; in zzlatbox_()
308 minz = minr * sin(minlat); in zzlatbox_()
310 maxz = minr * sin(maxlat); in zzlatbox_()
H A Dzzdsksgr.c23 doublereal minr; in zzdsksgr_() local
422 minr = dskdsc[20]; in zzdsksgr_()
423 if (minr <= 0.) { in zzdsksgr_()
426 errdp_("*", &minr, (ftnlen)1); in zzdsksgr_()
/dports/graphics/exrtools/exrtools-0.4/src/
H A Dexrstats.c43 double minr, maxr; in main() local
67 minl = minr = ming = minb = mina = DBL_MAX; in main()
90 if( r < minr ) minr = r; if( r > maxr ) maxr = r; in main()
125 minr, rav, maxr ); in main()
134 log( minr ), lrav, log( maxr ) ); in main()
/dports/graphics/graphviz/graphviz-2.44.1/cmd/gvpr/lib/
H A Dscale2 * finds distance minr of closest node
4 * a node is put on the smallest circle of radius x*minr
16 double fact, newr, ang, minr;
27 minr = (int)sqrt((double)mind);
40 newr = minr*(2.0 - (1.0/fact));
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bgui/
H A Dbgui_image_utils.cxx140 std::vector<double> minr(np, max_val), maxr(np,min_val); in init_histogram_from_data() local
145 if ((*dit)<minr[p]) minr[p] = *dit; in init_histogram_from_data()
148 unsigned short smin = static_cast<unsigned short>(minr[p]); in init_histogram_from_data()
497 std::vector<double> minr(np, 0.0), maxr(np, 0.0); in range_map_from_hist() local
500 if (!this->range(minr[p], maxr[p], p)) in range_map_from_hist()
505 rmp= new vgui_range_map_params(minr[0], maxr[0], gamma, invert, in range_map_from_hist()
511 rmp = new vgui_range_map_params(minr[0], maxr[0], minr[1], maxr[1], in range_map_from_hist()
512 minr[2], maxr[2], in range_map_from_hist()
520 rmp = new vgui_range_map_params(minr[0], maxr[0], minr[1], maxr[1], in range_map_from_hist()
521 minr[2], maxr[2], minr[3], maxr[3], in range_map_from_hist()
/dports/graphics/dcmtk/dcmtk-DCMTK-3.6.6/dcmimage/libsrc/
H A Ddiqtctab.cc158 int minr, maxr, ming, maxg, minb, maxb, v; in medianCut() local
173 minr = maxr = histogram.array[indx]->getRed(); in medianCut()
179 if ( v < minr ) minr = v; in medianCut()
197 if ( maxr - minr >= maxg - ming && maxr - minr >= maxb - minb ) in medianCut()
209 p.assign(maxr - minr, 0, 0); in medianCut()
263 int minr, maxr, ming, maxg, minb, maxb, v; in medianCut() local
265 minr = maxr = histogram.array[indx]->getRed(); in medianCut()
271 minr = (minr < v ? minr : v); in medianCut()
272 maxr = (minr > v ? minr : v); in medianCut()
280 array[bi]->assign(( minr + maxr ) / 2, ( ming + maxg ) / 2, ( minb + maxb ) / 2); in medianCut()
/dports/misc/rump/buildrump.sh-b914579/src/sys/dev/wscons/
H A Dwsmux.c199 int minr, unit; in wsmuxopen() local
201 minr = minor(dev); in wsmuxopen()
202 unit = WSMUXDEV(minr); in wsmuxopen()
210 if (WSMUXCTL(minr)) { in wsmuxopen()
307 int minr = minor(dev); in wsmuxclose() local
311 if (WSMUXCTL(minr)) in wsmuxclose()
366 int minr = minor(dev); in wsmuxread() local
371 if (WSMUXCTL(minr)) { in wsmuxread()
582 int minr = minor(dev); in wsmuxpoll() local
585 if (WSMUXCTL(minr)) { in wsmuxpoll()
[all …]

1234567891011