Home
last modified time | relevance | path

Searched refs:new_step (Results 1 – 25 of 197) sorted by relevance

12345678

/dports/misc/py-gluoncv/gluon-cv-0.9.0/gluoncv/data/video_custom/
H A Dclassification.py90 new_step=1, argument
120 self.new_step = new_step
257 self.new_step, size=self.skip_length // self.new_step)
274 self.new_step, size=self.skip_length // self.new_step)
291 self.new_step, size=self.skip_length // self.new_step)
316 offset += self.new_step
345 offset += self.new_step
369 offset += self.new_step
386 offset += self.new_step
401 offset += self.new_step
[all …]
/dports/net/iaxmodem/iaxmodem-1.2.0/lib/spandsp/src/
H A Dplc.c123 float new_step; in plc_rx() local
142 old_step = new_step*gain; in plc_rx()
143 new_weight = new_step; in plc_rx()
150 new_weight += new_step; in plc_rx()
167 float new_step; in plc_fillin() local
191 new_weight = new_step; in plc_fillin()
195 new_weight += new_step; in plc_fillin()
205 old_step = new_step; in plc_fillin()
206 new_weight = new_step; in plc_fillin()
207 old_weight = 1.0f - new_step; in plc_fillin()
[all …]
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/spandsp/src/
H A Dplc.c124 float new_step; in plc_rx() local
143 old_step = new_step*gain; in plc_rx()
144 new_weight = new_step; in plc_rx()
151 new_weight += new_step; in plc_rx()
168 float new_step; in plc_fillin() local
190 new_weight = new_step; in plc_fillin()
194 new_weight += new_step; in plc_fillin()
204 old_step = new_step; in plc_fillin()
205 new_weight = new_step; in plc_fillin()
206 old_weight = 1.0f - new_step; in plc_fillin()
[all …]
/dports/comms/spandsp/spandsp-284fe91/src/
H A Dplc.c124 float new_step; in plc_rx() local
143 old_step = new_step*gain; in plc_rx()
144 new_weight = new_step; in plc_rx()
151 new_weight += new_step; in plc_rx()
168 float new_step; in plc_fillin() local
190 new_weight = new_step; in plc_fillin()
194 new_weight += new_step; in plc_fillin()
204 old_step = new_step; in plc_fillin()
205 new_weight = new_step; in plc_fillin()
206 old_weight = 1.0f - new_step; in plc_fillin()
[all …]
/dports/games/flightgear/flightgear-2020.3.11/3rdparty/iaxclient/lib/spandsp/
H A Dplc.c146 float new_step; in plc_rx() local
165 old_step = new_step*gain; in plc_rx()
166 new_weight = new_step; in plc_rx()
173 new_weight += new_step; in plc_rx()
190 float new_step; in plc_fillin() local
214 new_weight = new_step; in plc_fillin()
218 new_weight += new_step; in plc_fillin()
228 old_step = new_step; in plc_fillin()
229 new_weight = new_step; in plc_fillin()
230 old_weight = 1.0 - new_step; in plc_fillin()
[all …]
/dports/math/R/R-4.1.2/src/library/stats/src/
H A Dzeroin.c127 double new_step; /* Step at this iteration */ in R_zeroin2() local
135 new_step = (c-b)/2; in R_zeroin2()
137 if( fabs(new_step) <= tol_act || fb == (double)0 ) in R_zeroin2()
169 new_step = p/q; /* it is accepted in R_zeroin2()
176 if( fabs(new_step) < tol_act) { /* Adjust the step to be not less*/ in R_zeroin2()
177 if( new_step > (double)0 ) /* than tolerance */ in R_zeroin2()
178 new_step = tol_act; in R_zeroin2()
180 new_step = -tol_act; in R_zeroin2()
183 b += new_step; fb = (*f)(b, info); /* Do step to a new approxim. */ in R_zeroin2()
/dports/math/R-cran-truncnorm/truncnorm/src/
H A Dzeroin.c126 double new_step; /* Step at this iteration */ in truncnorm_zeroin() local
137 new_step = (c - b) / 2; in truncnorm_zeroin()
139 if (fabs(new_step) <= tol_act || fb == (double)0) { in truncnorm_zeroin()
173 new_step = p / q; /* it is accepted in truncnorm_zeroin()
180 if (fabs(new_step) < tol_act) { /* Adjust the step to be not less*/ in truncnorm_zeroin()
181 if (new_step > (double)0) /* than tolerance */ in truncnorm_zeroin()
182 new_step = tol_act; in truncnorm_zeroin()
184 new_step = -tol_act; in truncnorm_zeroin()
188 b += new_step; in truncnorm_zeroin()
/dports/math/libRmath/R-4.1.1/src/library/stats/src/
H A Dzeroin.c127 double new_step; /* Step at this iteration */ in R_zeroin2() local
135 new_step = (c-b)/2; in R_zeroin2()
137 if( fabs(new_step) <= tol_act || fb == (double)0 ) in R_zeroin2()
169 new_step = p/q; /* it is accepted in R_zeroin2()
176 if( fabs(new_step) < tol_act) { /* Adjust the step to be not less*/ in R_zeroin2()
177 if( new_step > (double)0 ) /* than tolerance */ in R_zeroin2()
178 new_step = tol_act; in R_zeroin2()
180 new_step = -tol_act; in R_zeroin2()
183 b += new_step; fb = (*f)(b, info); /* Do step to a new approxim. */ in R_zeroin2()
/dports/net/kamailio/kamailio-5.4.5/src/modules/xcap_client/
H A Dxcap_functions.c135 str new_step= {NULL, 0}; in xcapNodeSelAddStep() local
155 if(new_step.s== NULL) in xcapNodeSelAddStep()
171 new_step.len= sprintf(new_step.s, "%c:", ns_card); in xcapNodeSelAddStep()
173 memcpy(new_step.s+new_step.len, name->s, name->len); in xcapNodeSelAddStep()
177 memcpy(new_step.s+new_step.len, "*", 1); in xcapNodeSelAddStep()
181 new_step.len+= sprintf(new_step.s+ new_step.len, "[%.*s=%.*s]", attr_test->name.len, in xcapNodeSelAddStep()
185 new_step.len+= sprintf(new_step.s+ new_step.len, "[%d]", pos); in xcapNodeSelAddStep()
189 memcpy(new_step.s+ new_step.len, extra_sel->s, extra_sel->len); in xcapNodeSelAddStep()
198 s->val= new_step; in xcapNodeSelAddStep()
234 if(new_step.s) in xcapNodeSelAddStep()
[all …]
/dports/math/igraph/igraph-0.9.5/src/internal/
H A Dzeroin.c131 igraph_real_t new_step; /* Step at this iteration */ in igraph_zeroin() local
141 new_step = (c - b) / 2; in igraph_zeroin()
143 if ( fabs(new_step) <= tol_act || fb == (igraph_real_t)0 ) { in igraph_zeroin()
176 new_step = p / q; in igraph_zeroin()
184 if ( fabs(new_step) < tol_act) { /* Adjust the step to be not less*/ in igraph_zeroin()
185 if ( new_step > (igraph_real_t)0 ) { /* than tolerance */ in igraph_zeroin()
186 new_step = tol_act; in igraph_zeroin()
188 new_step = -tol_act; in igraph_zeroin()
192 b += new_step; fb = (*f)(b, info); /* Do step to a new approxim. */ in igraph_zeroin()
/dports/math/R-cran-igraph/igraph/src/
H A Dzeroin.c130 igraph_real_t new_step; /* Step at this iteration */ in igraph_zeroin() local
140 new_step = (c - b) / 2; in igraph_zeroin()
142 if ( fabs(new_step) <= tol_act || fb == (igraph_real_t)0 ) { in igraph_zeroin()
175 new_step = p / q; in igraph_zeroin()
183 if ( fabs(new_step) < tol_act) { /* Adjust the step to be not less*/ in igraph_zeroin()
184 if ( new_step > (igraph_real_t)0 ) { /* than tolerance */ in igraph_zeroin()
185 new_step = tol_act; in igraph_zeroin()
187 new_step = -tol_act; in igraph_zeroin()
191 b += new_step; fb = (*f)(b, info); /* Do step to a new approxim. */ in igraph_zeroin()
/dports/science/opensim-core/opensim-core-4.1/OpenSim/Common/
H A DRootSolver.cpp99 Array<double> new_step(0.0,N); in solve() local
141 new_step[i] = 0.5 * (c[i]-b[i]); in solve()
145 if(fabs(new_step[i])<=tol_act[i] || fb[i]==(double)0.0 ) { in solve()
177 new_step[i] = p[i]/q[i]; in solve()
181 if( fabs(new_step[i]) < tol_act[i] ) { in solve()
182 if( new_step[i] > (double)0.0 ) { in solve()
183 new_step[i] = tol_act[i]; in solve()
186 new_step[i] = -tol_act[i]; in solve()
194 b[i] += new_step[i]; in solve()
/dports/math/unuran/unuran-1.8.1/src/utils/
H A Dfmax.c386 double new_step; /* Step at this iteration */ in _unur_util_brent() local
392 new_step = r * ( x<middle_range ? b-x : a-x ); in _unur_util_brent()
413 if( fabs(p) < fabs(new_step*q) && /* If x + p/q falls in [a,b] not too */ in _unur_util_brent()
416 new_step = p/q; /* If p/q is too large then the */ in _unur_util_brent()
421 if( fabs(new_step) < tol_act ) { /* Adjust the step to be not less */ in _unur_util_brent()
422 if( new_step > (double)0 ) /* than tolerance. */ in _unur_util_brent()
423 new_step = tol_act; in _unur_util_brent()
425 new_step = -tol_act; in _unur_util_brent()
429 register double t = x + new_step; /* Tentative point for the min */ in _unur_util_brent()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/mlir/test/Transforms/
H A Dparametric-mapping.mlir11 // CHECK: %[[new_step:.*]] = muli %[[step]], %[[threads]]#1
12 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
41 // new_step = step * gridDim.x * blockDim.x
42 // CHECK: %[[new_step:.*]] = muli %[[stepXgdimx]], %[[threads]]#1 : index
44 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/mlir/test/Transforms/
H A Dparametric-mapping.mlir11 // CHECK: %[[new_step:.*]] = muli %[[step]], %[[threads]]#1
12 // CHECK: loop.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
41 // new_step = step * gridDim.x * blockDim.x
42 // CHECK: %[[new_step:.*]] = muli %[[stepXgdimx]], %[[threads]]#1 : index
44 // CHECK: loop.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/mlir/test/Transforms/
H A Dparametric-mapping.mlir11 // CHECK: %[[new_step:.*]] = muli %[[step]], %[[threads]]#1
12 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
41 // new_step = step * gridDim.x * blockDim.x
42 // CHECK: %[[new_step:.*]] = muli %[[stepXgdimx]], %[[threads]]#1 : index
44 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/mlir/test/Transforms/
H A Dparametric-mapping.mlir11 // CHECK: %[[new_step:.*]] = muli %[[step]], %[[threads]]#1
12 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
41 // new_step = step * gridDim.x * blockDim.x
42 // CHECK: %[[new_step:.*]] = muli %[[stepXgdimx]], %[[threads]]#1 : index
44 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/devel/llvm12/llvm-project-12.0.1.src/mlir/test/Transforms/
H A Dparametric-mapping.mlir11 // CHECK: %[[new_step:.*]] = muli %[[step]], %[[threads]]#1
12 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
41 // new_step = step * gridDim.x * blockDim.x
42 // CHECK: %[[new_step:.*]] = muli %[[stepXgdimx]], %[[threads]]#1 : index
44 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/mlir/test/Transforms/
H A Dparametric-mapping.mlir14 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[step]]]
16 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
45 // new_step = step * gridDim.x * blockDim.x
46 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[stepXgdimx]]]
48 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/mlir/test/Transforms/
H A Dparametric-mapping.mlir14 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[step]]]
16 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
45 // new_step = step * gridDim.x * blockDim.x
46 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[stepXgdimx]]]
48 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/mlir/test/Transforms/
H A Dparametric-mapping.mlir14 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[step]]]
16 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
45 // new_step = step * gridDim.x * blockDim.x
46 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[stepXgdimx]]]
48 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/devel/llvm13/llvm-project-13.0.1.src/mlir/test/Transforms/
H A Dparametric-mapping.mlir14 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[step]]]
16 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
45 // new_step = step * gridDim.x * blockDim.x
46 // CHECK: %[[new_step:.+]] = affine.apply #[[mul_map]]()[%[[threads]]#1, %[[stepXgdimx]]]
48 // CHECK: scf.for %{{.*}} = %[[new_lb]] to %[[ub]] step %[[new_step]] {
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Numerics/Optimizers/src/
H A DitkPowellOptimizer.cxx277 double new_step; /* Step at this iteration */ in BracketedLineOptimize() local
298 new_step = goldenSectionRatio * ( x < middle_range ? b - x : a - x ); in BracketedLineOptimize()
325 if ( std::fabs(p) < std::fabs(new_step * q) in BracketedLineOptimize()
329 new_step = p / q; /* it is accepted */ in BracketedLineOptimize()
337 if ( std::fabs(new_step) < tolerance1 ) in BracketedLineOptimize()
339 if ( new_step > 0.0 ) in BracketedLineOptimize()
341 new_step = tolerance1; in BracketedLineOptimize()
345 new_step = -tolerance1; in BracketedLineOptimize()
351 double t = x + new_step; /* Tentative point for the min */ in BracketedLineOptimize()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Numerics/Optimizersv4/include/
H A DitkPowellOptimizerv4.hxx263 double new_step; /* Step at this iteration */ in BracketedLineOptimize() local
284 new_step = goldenSectionRatio * ( x < middle_range ? b - x : a - x ); in BracketedLineOptimize()
311 if ( std::fabs(p) < std::fabs(new_step * q) in BracketedLineOptimize()
315 new_step = p / q; /* it is accepted */ in BracketedLineOptimize()
323 if ( std::fabs(new_step) < tolerance1 ) in BracketedLineOptimize()
325 if ( new_step > 0.0 ) in BracketedLineOptimize()
327 new_step = tolerance1; in BracketedLineOptimize()
331 new_step = -tolerance1; in BracketedLineOptimize()
337 double t = x + new_step; /* Tentative point for the min */ in BracketedLineOptimize()
/dports/math/gismo/gismo-21.12.0/src/gsNurbs/
H A DgsBoehm.hpp302 unsigned new_step = new_str[direction]; in gsTensorBoehm() local
338 new_coef.row(new_ind + new_step * L) = tmp.row(0); in gsTensorBoehm()
339 new_coef.row(new_ind + new_step * (k + r - j - s)) = in gsTensorBoehm()
427 const int new_step = new_str[direction]; in gsTensorBoehmRefine() local
450 new_coefs.row(new_ind + (j + nik - 1) * new_step) = in gsTensorBoehmRefine()
462 new_coefs.row(new_ind + (k - p - 1) * new_step) = in gsTensorBoehmRefine()
468 new_coefs.row(new_ind + (k - p - 1) * new_step) = in gsTensorBoehmRefine()
469 new_coefs.row(new_ind + (k - p) * new_step); in gsTensorBoehmRefine()
477 new_coefs.row(new_ind + (index - 1) * new_step) = in gsTensorBoehmRefine()
478 new_coefs.row(new_ind + index * new_step); in gsTensorBoehmRefine()
[all …]

12345678