Home
last modified time | relevance | path

Searched refs:stepsize (Results 1 – 12 of 12) sorted by relevance

/third_party/python/Tools/scripts/
Dpindent.py332 stepsize = STEPSIZE, tabsize = TABSIZE, expandtabs = EXPANDTABS): argument
333 pi = PythonIndenter(input, output, stepsize, tabsize, expandtabs)
338 stepsize = STEPSIZE, tabsize = TABSIZE, expandtabs = EXPANDTABS): argument
339 pi = PythonIndenter(input, output, stepsize, tabsize, expandtabs)
344 stepsize = STEPSIZE, tabsize = TABSIZE, expandtabs = EXPANDTABS): argument
345 pi = PythonIndenter(input, output, stepsize, tabsize, expandtabs)
349 def complete_string(source, stepsize = STEPSIZE, tabsize = TABSIZE, expandtabs = EXPANDTABS): argument
352 pi = PythonIndenter(input, output, stepsize, tabsize, expandtabs)
357 def delete_string(source, stepsize = STEPSIZE, tabsize = TABSIZE, expandtabs = EXPANDTABS): argument
360 pi = PythonIndenter(input, output, stepsize, tabsize, expandtabs)
[all …]
/third_party/pulseaudio/src/modules/echo-cancel/
Dadrian-aec.c127 float ratio, stepsize; in AEC_dtd() local
150 stepsize = STEPY1; in AEC_dtd()
152 stepsize = STEPY2; in AEC_dtd()
154 stepsize = STEPY1 + (STEPY2 - STEPY1) * (ratio - STEPX1) / (STEPX2 - STEPX1); in AEC_dtd()
156 return stepsize; in AEC_dtd()
188 static REAL AEC_nlms_pw(AEC *a, REAL d, REAL x_, float stepsize) in AEC_nlms_pw() argument
206 if (stepsize > 0.0f) { in AEC_nlms_pw()
208 REAL mikro_ef = stepsize * ef / a->dotp_xf_xf; in AEC_nlms_pw()
259 a->stepsize = AEC_dtd(a, d, x); in AEC_doAEC()
265 d = AEC_nlms_pw(a, d, x, a->stepsize); in AEC_doAEC()
Dadrian-aec.h327 float stepsize; member
352 static REAL AEC_nlms_pw(AEC *a, REAL d, REAL x_, float stepsize);
/third_party/boost/libs/math/doc/interpolators/
Dcardinal_quadratic_b_spline.qbk26 Real h /*spacing, stepsize*/,
32 Real h /*spacing, stepsize*/,
Dcardinal_quintic_b_spline.qbk26 Real h /*spacing, stepsize*/,
32 Real h /*spacing, stepsize*/,
Dcardinal_cubic_b_spline.qbk106 Let /h/ be the stepsize. If /f/ is four-times continuously differentiable, then the interpolant is …
/third_party/python/Lib/test/
Dtest_bigmem.py504 stepsize = len(s) // 100
505 stepsize = stepsize - (stepsize % sublen)
506 for i in range(0, len(s) - stepsize, stepsize):
/third_party/boost/libs/math/doc/differentiation/
Dnumerical_differentiation.qbk44 …r this reason boost's `finite_difference_derivative` does not require the user to input a stepsize.
/third_party/boost/libs/math/doc/quadrature/
Dtrapezoidal.qbk85 The stepsize would be halved repeatedly, generating an exponential explosion in function evaluation…
/third_party/mindspore/third_party/proto/caffe/
Dcaffe.proto168 // return base_lr ( 1/(1 + exp(-gamma * (iter - stepsize))))
180 // the stepsize for learning rate policy "step"
181 optional int32 stepsize = 13; field
182 // the stepsize for learning rate policy "multistep"
/third_party/pulseaudio/src/modules/rtp/
Drfc3551.txt708 u_int8 index; /* current index into stepsize table */
/third_party/ffmpeg/doc/
Dfilters.texi21046 @item stepsize
21047 Set stepsize of the search process. The region around minimum is