Home
last modified time | relevance | path

Searched refs:nmin (Results 1 – 25 of 1073) sorted by relevance

12345678910>>...43

/dports/games/minetest/minetest-5.4.1/src/mapgen/
H A Dmg_ore.cpp172 u32 index = sizex * (z0 - nmin.Z) + (x0 - nmin.X); in generate()
230 noise->perlinMap2D(nmin.X, nmin.Z); in generate()
304 noise->perlinMap2D(nmin.X, nmin.Z); in generate()
322 noise_puff_top->perlinMap2D(nmin.X, nmin.Z); in generate()
323 noise_puff_bottom->perlinMap2D(nmin.X, nmin.Z); in generate()
390 u32 bmapidx = sizex * (z0 - nmin.Z) + (x0 - nmin.X); in generate()
487 u32 bmapidx = sizex * (z - nmin.Z) + (x - nmin.X); in generate()
496 noise->perlinMap3D(nmin.X, nmin.Y, nmin.Z); in generate()
497 noise2->perlinMap3D(nmin.X, nmin.Y, nmin.Z); in generate()
550 noise->perlinMap2D(nmin.X, nmin.Z); in generate()
[all …]
/dports/games/freeminer/freeminer-0.4.10.4/src/
H A Dmg_ore.cpp85 ymin = MYMAX(nmin.Y, -height_max); in placeOre()
88 ymin = MYMAX(nmin.Y, height_min); in placeOre()
94 nmin.Y = ymin; in placeOre()
103 u32 blockseed, v3s16 nmin, v3s16 nmax) in generate() argument
108 int volume = (nmax.X - nmin.X + 1) * in generate()
109 (nmax.Y - nmin.Y + 1) * in generate()
110 (nmax.Z - nmin.Z + 1); in generate()
140 u32 blockseed, v3s16 nmin, v3s16 nmax) in generate() argument
149 int sx = nmax.X - nmin.X + 1; in generate()
150 int sz = nmax.Z - nmin.Z + 1; in generate()
[all …]
H A Dmg_decoration.cpp79 int carea_size = nmax.X - nmin.X + 1; in placeDeco()
94 nmin.X + sidelen / 2 + sidelen * x0, in placeDeco()
95 nmin.Z + sidelen / 2 + sidelen * z0 in placeDeco()
98 nmin.X + sidelen * x0, in placeDeco()
99 nmin.Z + sidelen * z0 in placeDeco()
102 nmin.X + sidelen + sidelen * x0 - 1, in placeDeco()
103 nmin.Z + sidelen + sidelen * z0 - 1 in placeDeco()
116 int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X); in placeDeco()
122 if (y < nmin.Y || y > nmax.Y) in placeDeco()
170 p.Z < nmin.Z || p.Z > nmax.Z)
[all …]
/dports/math/p5-Math-GSL/Math-GSL-0.43/swig/
H A DSF.i28 array_wrapper* gsl_sf_bessel_Jn_array_wrapper(int nmin, int nmax, double x);
31 array_wrapper* gsl_sf_bessel_Yn_array_wrapper(int nmin, int nmax, double x);
34 array_wrapper* gsl_sf_bessel_In_array_wrapper(int nmin, int nmax, double x);
37 array_wrapper* gsl_sf_bessel_In_scaled_array_wrapper(int nmin, int nmax, double x);
40 array_wrapper* gsl_sf_bessel_Kn_array_wrapper(int nmin, int nmax, double x);
43 array_wrapper* gsl_sf_bessel_Kn_scaled_array_wrapper(int nmin, int nmax, double x);
101 array_wrapper* gsl_sf_bessel_Jn_array_wrapper(int nmin, int nmax, double x) { in gsl_sf_bessel_Jn_array_wrapper() argument
104 ret = gsl_sf_bessel_Jn_array(nmin,nmax,x, (double*)(wrapper->data)); in gsl_sf_bessel_Jn_array_wrapper()
112 ret = gsl_sf_bessel_Yn_array(nmin,nmax,x, (double*)(wrapper->data)); in gsl_sf_bessel_Yn_array_wrapper()
120 ret = gsl_sf_bessel_In_array(nmin,nmax,x, (double*)(wrapper->data)); in gsl_sf_bessel_In_array_wrapper()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/nasm/
H A Dversion.pl102 $nmaj = $maj+0; $nmin = $min+0;
111 if ($nmin > 0) {
112 $nmin--;
114 $nmin = 99;
122 $mangled_ver = sprintf("%d.%02d", $nmaj, $nmin);
136 printf "#define NASM_MINOR_VER %d\n", $nmin;
148 printf "%%define __NASM_MINOR__ %d\n", $nmin;
158 printf "s/\@\@NASM_MINOR\@\@/%d/g\n", $nmin;
169 printf "NASM_MINOR_VER=%d\n", $nmin;
174 printf "!define MAJOR_VER %d\n", $nmin;
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/nasm/
H A Dversion.pl106 $nmaj = $maj+0; $nmin = $min+0;
115 if ($nmin > 0) {
116 $nmin--;
118 $nmin = 99;
126 $mangled_ver = sprintf("%d.%02d", $nmaj, $nmin);
140 printf "#define NASM_MINOR_VER %d\n", $nmin;
152 printf "%%define __?NASM_MINOR?__ %d\n", $nmin;
162 printf "s/\@\@NASM_MINOR\@\@/%d/g\n", $nmin;
173 printf "NASM_MINOR_VER=%d\n", $nmin;
178 printf "!define MAJOR_VER %d\n", $nmin;
[all …]
/dports/devel/nasm/nasm-2.15.05/
H A Dversion.pl106 $nmaj = $maj+0; $nmin = $min+0;
115 if ($nmin > 0) {
116 $nmin--;
118 $nmin = 99;
126 $mangled_ver = sprintf("%d.%02d", $nmaj, $nmin);
140 printf "#define NASM_MINOR_VER %d\n", $nmin;
152 printf "%%define __?NASM_MINOR?__ %d\n", $nmin;
162 printf "s/\@\@NASM_MINOR\@\@/%d/g\n", $nmin;
173 printf "NASM_MINOR_VER=%d\n", $nmin;
178 printf "!define MAJOR_VER %d\n", $nmin;
[all …]
/dports/graphics/geos/geos-3.9.1/src/index/bintree/
H A DInterval.cpp28 Interval::Interval(double nmin, double nmax) in Interval() argument
30 init(nmin, nmax); in Interval()
39 Interval::init(double nmin, double nmax) in init() argument
41 min = nmin; in init()
45 max = nmin; in init()
85 Interval::overlaps(double nmin, double nmax) const in overlaps() argument
87 if(min > nmax || max < nmin) { in overlaps()
100 Interval::contains(double nmin, double nmax) const in contains() argument
102 return (nmin >= min && nmax <= max); in contains()
/dports/math/dbcsr/dbcsr-2.1.0/src/tensors/
H A Ddbcsr_tensor.fypp47 $: ", ".join([name + "(" + ":," * ndim_pre + str(i) + ",:"*ndim_post + ")" for i in range(nmin, …
52 $: ", ".join([name + "_" + str(i) + suffix for i in range(nmin, nmax+1)])
85 … str(i) + suffix + " = " + namesuffix + name + "_" + str(i) + suffix for i in range(nmin, nmax+1)])
90 $: ", ".join([name + "_" + str(i) + suffix + "(" + ":" + ")" for i in range(nmin, nmax+1)])
95 … + "_" + str(i) + ", " + name + "_" + str(i) + "_" + "size" + suffix for i in range(nmin, nmax+1)])
100 $: ", ".join([name + "_" + str(i) + "_" + "size" + suffix for i in range(nmin, nmax+1)])
105 …ame + "_" + str(i) + "(" + name + "_" + str(i) + "_" + "size" + ")" for i in range(nmin, nmax+1)])
110 …_" + str(i) + suffix + " => " + "c_" + name + "_" + str(i) + suffix for i in range(nmin, nmax+1)])
115 …i) + ", " + type + " " + name + "_" + str(i) + "_" + "size" + suffix for i in range(nmin, nmax+1)])
120 …tr(i) + ", " + "int* " + name + "_" + str(i) + "_" + "size" + suffix for i in range(nmin, nmax+1)])
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/exts/dbcsr/src/tensors/
H A Ddbcsr_tensor.fypp47 $: ", ".join([name + "(" + ":," * ndim_pre + str(i) + ",:"*ndim_post + ")" for i in range(nmin, …
52 $: ", ".join([name + "_" + str(i) + suffix for i in range(nmin, nmax+1)])
85 … str(i) + suffix + " = " + namesuffix + name + "_" + str(i) + suffix for i in range(nmin, nmax+1)])
90 $: ", ".join([name + "_" + str(i) + suffix + "(" + ":" + ")" for i in range(nmin, nmax+1)])
95 … + "_" + str(i) + ", " + name + "_" + str(i) + "_" + "size" + suffix for i in range(nmin, nmax+1)])
100 $: ", ".join([name + "_" + str(i) + "_" + "size" + suffix for i in range(nmin, nmax+1)])
105 …ame + "_" + str(i) + "(" + name + "_" + str(i) + "_" + "size" + ")" for i in range(nmin, nmax+1)])
110 …_" + str(i) + suffix + " => " + "c_" + name + "_" + str(i) + suffix for i in range(nmin, nmax+1)])
115 …i) + ", " + type + " " + name + "_" + str(i) + "_" + "size" + suffix for i in range(nmin, nmax+1)])
120 …tr(i) + ", " + "int* " + name + "_" + str(i) + "_" + "size" + suffix for i in range(nmin, nmax+1)])
/dports/math/py-pygsl/pygsl-2.3.0/testing/src/sf/
H A Dsf__arrays.c64 int nmin=0, nmax=0, dimension = 0, ret; in PyGSL_sf_array_evaluator_iid_ad() local
72 if(nmin < 0){ in PyGSL_sf_array_evaluator_iid_ad()
77 if(nmax < nmin){ in PyGSL_sf_array_evaluator_iid_ad()
87 ret = eval(nmin, nmax, x, data); in PyGSL_sf_array_evaluator_iid_ad()
105 int nmin=0, nmax=0, dimension = 0, ret; in PyGSL_sf_array_evaluator_id_ad() local
113 if(nmin < 0){ in PyGSL_sf_array_evaluator_id_ad()
141 int nmin=0, nmax=0, dimension = 0, ret; in PyGSL_sf_array_evaluator_idd_ad() local
149 if(nmin < 0){ in PyGSL_sf_array_evaluator_idd_ad()
215 if(nmin < 0){ in PyGSL_sf_array_evaluator_didd_add()
250 if(nmin < 0){ in PyGSL_sf_array_evaluator_didd_addadd()
[all …]
/dports/audio/praat/praat-6.2.03/external/gsl/
H A Dgsl_specfunc__bessel_In.c117 if(nmax < nmin || nmin < 0) {
119 for(j=0; j<=nmax-nmin; j++) result_array[j] = 0.0;
124 for(j=0; j<=nmax-nmin; j++) result_array[j] = 0.0;
125 if(nmin == 0) result_array[0] = 1.0;
148 for(n=nmax; n>=nmin; n--) {
149 result_array[n-nmin] = In;
157 for(n=nmin; n<=nmax; n++) {
158 if(GSL_IS_ODD(n)) result_array[n-nmin] = -result_array[n-nmin];
201 for(j=0; j<=nmax-nmin; j++) result_array[j] = 0.0; /* FIXME: should be Inf */
207 int status = gsl_sf_bessel_In_scaled_array(nmin, nmax, x, result_array);
[all …]
H A Dgsl_specfunc__bessel_Jn.c143 gsl_sf_bessel_Jn_array(int nmin, int nmax, double x, double * result_array) in gsl_sf_bessel_Jn_array() argument
147 if(nmin < 0 || nmax < nmin) { in gsl_sf_bessel_Jn_array()
149 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_Jn_array()
150 result_array[n-nmin] = 0.0; in gsl_sf_bessel_Jn_array()
156 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_Jn_array()
157 result_array[n-nmin] = 0.0; in gsl_sf_bessel_Jn_array()
159 if(nmin == 0) result_array[0] = 1.0; in gsl_sf_bessel_Jn_array()
175 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_Jn_array()
176 result_array[n-nmin] = Jn; in gsl_sf_bessel_Jn_array()
183 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_Jn_array()
[all …]
H A Dgsl_specfunc__bessel_Kn.c164 int gsl_sf_bessel_Kn_scaled_array(const int nmin, const int nmax, const double x, double * result_a…
168 if(nmin < 0 || nmax < nmin || x <= 0.0) {
170 for(j=0; j<=nmax-nmin; j++) result_array[j] = 0.0;
183 int stat_0 = gsl_sf_bessel_Kn_scaled_e(nmin, x, &r_Knm1);
184 int stat_1 = gsl_sf_bessel_Kn_scaled_e(nmin+1, x, &r_Kn);
191 for(n=nmin+1; n<=nmax+1; n++) {
193 result_array[n-1-nmin] = Knm1;
207 for(j=n; j<=nmax+1; j++) result_array[j-1-nmin] = 0.0;
218 gsl_sf_bessel_Kn_array(const int nmin, const int nmax, const double x, double * result_array)
220 int status = gsl_sf_bessel_Kn_scaled_array(nmin, nmax, x, result_array);
[all …]
/dports/math/gsl/gsl-2.7/specfunc/
H A Dbessel_In.c117 if(nmax < nmin || nmin < 0) { in gsl_sf_bessel_In_scaled_array()
119 for(j=0; j<=nmax-nmin; j++) result_array[j] = 0.0; in gsl_sf_bessel_In_scaled_array()
124 for(j=0; j<=nmax-nmin; j++) result_array[j] = 0.0; in gsl_sf_bessel_In_scaled_array()
125 if(nmin == 0) result_array[0] = 1.0; in gsl_sf_bessel_In_scaled_array()
148 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_In_scaled_array()
149 result_array[n-nmin] = In; in gsl_sf_bessel_In_scaled_array()
157 for(n=nmin; n<=nmax; n++) { in gsl_sf_bessel_In_scaled_array()
158 if(GSL_IS_ODD(n)) result_array[n-nmin] = -result_array[n-nmin]; in gsl_sf_bessel_In_scaled_array()
201 for(j=0; j<=nmax-nmin; j++) result_array[j] = 0.0; /* FIXME: should be Inf */ in gsl_sf_bessel_In_array()
207 int status = gsl_sf_bessel_In_scaled_array(nmin, nmax, x, result_array); in gsl_sf_bessel_In_array()
[all …]
H A Dbessel_Jn.c143 gsl_sf_bessel_Jn_array(int nmin, int nmax, double x, double * result_array) in gsl_sf_bessel_Jn_array() argument
147 if(nmin < 0 || nmax < nmin) { in gsl_sf_bessel_Jn_array()
149 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_Jn_array()
150 result_array[n-nmin] = 0.0; in gsl_sf_bessel_Jn_array()
156 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_Jn_array()
157 result_array[n-nmin] = 0.0; in gsl_sf_bessel_Jn_array()
159 if(nmin == 0) result_array[0] = 1.0; in gsl_sf_bessel_Jn_array()
175 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_Jn_array()
176 result_array[n-nmin] = Jn; in gsl_sf_bessel_Jn_array()
183 for(n=nmax; n>=nmin; n--) { in gsl_sf_bessel_Jn_array()
[all …]
H A Dbessel_Kn.c164 int gsl_sf_bessel_Kn_scaled_array(const int nmin, const int nmax, const double x, double * result_a… in gsl_sf_bessel_Kn_scaled_array() argument
168 if(nmin < 0 || nmax < nmin || x <= 0.0) { in gsl_sf_bessel_Kn_scaled_array()
170 for(j=0; j<=nmax-nmin; j++) result_array[j] = 0.0; in gsl_sf_bessel_Kn_scaled_array()
183 int stat_0 = gsl_sf_bessel_Kn_scaled_e(nmin, x, &r_Knm1); in gsl_sf_bessel_Kn_scaled_array()
184 int stat_1 = gsl_sf_bessel_Kn_scaled_e(nmin+1, x, &r_Kn); in gsl_sf_bessel_Kn_scaled_array()
191 for(n=nmin+1; n<=nmax+1; n++) { in gsl_sf_bessel_Kn_scaled_array()
193 result_array[n-1-nmin] = Knm1; in gsl_sf_bessel_Kn_scaled_array()
207 for(j=n; j<=nmax+1; j++) result_array[j-1-nmin] = 0.0; in gsl_sf_bessel_Kn_scaled_array()
218 gsl_sf_bessel_Kn_array(const int nmin, const int nmax, const double x, double * result_array) in gsl_sf_bessel_Kn_array() argument
220 int status = gsl_sf_bessel_Kn_scaled_array(nmin, nmax, x, result_array); in gsl_sf_bessel_Kn_array()
[all …]
/dports/science/tinker/tinker/other/
H A Dagda.f472 nmin = 0
474 nmin = nmin + 1
476 nmin = nmin + 1
478 nmin = nmin + 1
498 nmin = 0
500 nmin = nmin + 1
502 nmin = nmin + 1
504 nmin = nmin + 1
553 nmin = nmin + 1
555 nmin = nmin + 1
[all …]
H A Dreorder.f33 integer i,nmin,lext,next
62 nmin = 0
66 nmin = nmin + 1
68 call getnumb (record,imin(nmin),next)
69 call gettext (record,emin(nmin),next)
84 do i = 1, nmin
/dports/math/fricas/fricas-1.3.7/src/algebra/
H A Dnumquad.spad293 if (nmin < 2) then
294 output("romberg: nmin to small (nmin > 1) nmin = ",nmin::E)
298 output(" nmin = ",nmin::E)
319 if n > nmin then
341 if (nmin < 2) then
342 output("simpson: nmin to small (nmin > 1) nmin = ",nmin::E)
346 output(" nmin = ",nmin::E)
361 if n > nmin then
379 if (nmin < 2) then
380 output("trapezoidal: nmin to small (nmin > 1) nmin = ",nmin::E)
[all …]
/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/solver/matrix/
H A Dhecmw_matrix_ordering_CM.f9026 integer(kind=kint) :: i, nmin local
34 call find_minimum_degrees(N, degs, NMINMAX, nmin, mins)
35 allocate(nlevel(nmin), lv_index(0:N,nmin), lv_item(N,nmin))
40 do i=1,nmin
51 do i=2,nmin
186 integer(kind=kint), intent(out) :: nmin local
190 nmin = 0
196 nmin = 1
199 nmin = nmin + 1
200 if (nmin <= nminmax) mins(nmin) = i
[all …]
/dports/audio/x42-plugins-lv2/x42-plugins-20211016/midifilter.lv2/filters/
H A Dvelocityscale.c56 const float nmin = *(self->cfg[1]);
59 const float oneoff = (nmax-nmin)/126.0;
60 buf[2] = RAIL(rintf((float)vel * (nmax-nmin) / 126.0 + nmin - oneoff + offset), 1, 127);
65 const float nmin = *(self->cfg[4]);
68 buf[2] = RAIL(rintf((float)vel * (nmax-nmin) / 127.0 + nmin + offset), 0, 127);
/dports/science/gromacs/gromacs-2021.4/src/gromacs/fft/
H A Dcalcgrid.cpp68 int nmin, fac2, attempt; in calcFftGrid() local
120 nmin = static_cast<int>(box_size[d] / gridSpacing + 0.999); in calcFftGrid()
121 nmin = std::max(nmin, minGridPointsPerDim); in calcFftGrid()
124 if (grid_init[i] >= nmin) in calcFftGrid()
127 while (i > 0 && grid_init[i - 1] >= nmin) in calcFftGrid()
138 while (fac2 * grid_base[i] < nmin) in calcFftGrid()
147 if (((attempt % 4 == 0 && attempt != 140) || attempt == 90) && attempt >= nmin) in calcFftGrid()
/dports/math/nauty/nauty27r3/
H A Dassembleg.c172 assemble(graph *g, int nmin, int nmax, int sofar, int lastpos, in assemble() argument
185 if (newsize >= nmin && (sofar > 0 || writeconn)) in assemble()
195 assemble(g,nmin,nmax,newsize,pos,writeconn,outfile); in assemble()
216 long nmin,nmax,mmax,imin,imax; in main() local
238 else SWRANGE('n',":-",nswitch,nmin,nmax,"assembleg -n") in main()
261 if (nmin <= 0) nmin = 1; in main()
262 if (nmin > NAUTY_INFINITY-2) nmin = NAUTY_INFINITY-2; in main()
267 if (nmin == nmax) fprintf(stderr,"n%ld",nmin); in main()
268 else fprintf(stderr,"n%ld:%ld",nmin,nmax); in main()
323 assemble(gout,(int)nmin,(int)nmax,0,0,cswitch,outfile); in main()
[all …]
/dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/
H A Dassembleg.c172 assemble(graph *g, int nmin, int nmax, int sofar, int lastpos, in assemble() argument
185 if (newsize >= nmin && (sofar > 0 || writeconn)) in assemble()
195 assemble(g,nmin,nmax,newsize,pos,writeconn,outfile); in assemble()
216 long nmin,nmax,mmax,imin,imax; in main() local
238 else SWRANGE('n',":-",nswitch,nmin,nmax,"assembleg -n") in main()
261 if (nmin <= 0) nmin = 1; in main()
262 if (nmin > NAUTY_INFINITY-2) nmin = NAUTY_INFINITY-2; in main()
267 if (nmin == nmax) fprintf(stderr,"n%ld",nmin); in main()
268 else fprintf(stderr,"n%ld:%ld",nmin,nmax); in main()
323 assemble(gout,(int)nmin,(int)nmax,0,0,cswitch,outfile); in main()
[all …]

12345678910>>...43