/external/ceres-solver/internal/ceres/ |
H A D | levenberg_marquardt_strategy.cc | 69 double* step) { 72 CHECK_NOTNULL(step); 101 InvalidateArray(num_parameters, step); 107 linear_solver_->Solve(jacobian, residuals, solve_options, step); 112 !IsArrayValid(num_parameters, step)) { 113 LOG(WARNING) << "Linear solver failure. Failed to compute a finite step."; 116 VectorRef(step, num_parameters) *= -1.0; 128 step, 65 ComputeStep( const TrustRegionStrategy::PerSolveOptions& per_solve_options, SparseMatrix* jacobian, const double* residuals, double* step) argument
|
H A D | trust_region_minimizer.h | 58 const double* step) const;
|
H A D | dogleg_strategy.h | 40 // Dogleg step computation and trust region sizing strategy based on 47 // Gauss-Newton step, we compute a regularized version of it. This is 64 double* step); 88 void ComputeTraditionalDoglegStep(double* step); 90 void ComputeSubspaceDoglegStep(double* step); 107 // reports an invalid step, the value of mu_ is increased so that 110 // If a successful step is reported, then the value of mu_ is 144 // problem with the step computed in the last call to ComputeStep,
|
/external/apache-http/src/org/apache/http/conn/routing/ |
H A D | BasicRouteDirector.java | 59 * Provides the next step. 66 * either the next step to perform, or success, or failure. 75 int step = UNREACHABLE; 78 step = firstStep(plan); 80 step = proxiedStep(plan, fact); 82 step = directStep(plan, fact); 84 return step; 90 * Determines the first step to establish a route. 94 * @return the first step 104 * Determines the next step t [all...] |
/external/skia/bench/ |
H A D | InterpBench.cpp | 56 SkFixed step = SkFloatToFixed(dx); variable 58 dst[i + 0] = TILE(curr, count); curr += step; 59 dst[i + 1] = TILE(curr, count); curr += step; 60 dst[i + 2] = TILE(curr, count); curr += step; 61 dst[i + 3] = TILE(curr, count); curr += step; 75 int64_t step = (int64_t)(dx * 65536 * 655536); variable 80 curr += step; 84 curr += step; 88 curr += step; 92 curr += step; 106 int64_t step = (int64_t)(dx * 65536 * 655536 * 65536); variable [all...] |
/external/tremolo/Tremolo/ |
H A D | mdct.c | 64 STIN void presymmetry(DATA_TYPE *in,int n2,int step){ argument 76 XPROD31( s0, s2, T[0], T[1], &aX[0], &aX[2] ); T+=step; 82 XPROD31( s0, s2, T[1], T[0], &aX[0], &aX[2] ); T-=step; 95 XNPROD31( ro2, ro0, T[1], T[0], &aX[0], &aX[2] ); T+=step; 197 STIN void mdct_butterfly_generic(DATA_TYPE *x,int points,int step){ argument 209 XPROD31( s2, s3, T[0], T[1], &x2[1], &x2[3] ); T+=step; 222 XNPROD31( s3, s2, T[0], T[1], &x2[1], &x2[3] ); T-=step; 274 STIN void mdct_step7(DATA_TYPE *x,int n,int step){ argument 277 LOOKUP_T *T = (step>=4)?(sincos_lookup0+(step>> 320 mdct_step8(DATA_TYPE *x, int n, int step) argument 413 int step; local 468 mdct_unroll_lap(int n0,int n1, int lW,int W, DATA_TYPE *in, DATA_TYPE *right, LOOKUP_T *w0, LOOKUP_T *w1, ogg_int16_t *out, int step, int start, int end ) argument [all...] |
/external/libunwind/tests/ |
H A D | Gperf-simple.c | 58 measure_unwind (int maxlevel, double *step) argument 86 *step = (stop - start) / (double) level; 93 g1 (int level, int maxlevel, double *step) argument 96 return measure_unwind (maxlevel, step); 99 return f1 (level + 1, maxlevel, step) + level; 103 f1 (int level, int maxlevel, double *step) argument 106 return measure_unwind (maxlevel, step); 109 return g1 (level + 1, maxlevel, step) + level; 115 double step, min_step, first_step, sum_step; local 122 f1 (0, maxlevel, &step); [all...] |
H A D | Gperf-trace.c | 58 measure_unwind (int maxlevel, double *step) argument 72 *step = (stop - start) / (double) level; 79 g1 (int level, int maxlevel, double *step) argument 82 return measure_unwind (maxlevel, step); 85 return f1 (level + 1, maxlevel, step) + level; 89 f1 (int level, int maxlevel, double *step) argument 92 return measure_unwind (maxlevel, step); 95 return g1 (level + 1, maxlevel, step) + level; 101 double step, min_step, first_step, sum_step; local 108 f1 (0, maxlevel, &step); [all...] |
/external/v8/src/ |
H A D | uri.h | 57 int* step)); 94 int step; local 95 if (UnescapeChar(vector, i, length, &step) > 99 i += step; 116 int step; local 118 UnescapeChar(vector, i, length, &step)); 119 i += step; 128 int step; local 130 UnescapeChar(vector, i, length, &step)); 131 i += step; 151 UnescapeChar(Vector<const Char> vector, int i, int length, int* step) argument [all...] |
/external/opencv/cxcore/src/ |
H A D | cxlogic.cpp | 64 uchar* dst, int step, CvSize size ), (src1, step1, src2, step2, dst, step, size) )\ 66 for( ; size.height--; src1 += step1, src2 += step2, dst += step ) \ 112 ( const uchar* src0, int step1, uchar* dst0, int step, CvSize size, \ 117 for( ; size.height--; src0 += step1, dst0 += step ) \ 288 dstbuf.step = cvAlign( dstbuf.step, 8 ); 289 buf_size = dstbuf.step ? dstbuf.step*dy : size.width*elem_size; 303 src_step = src->step; 573 IPCVAPI_IMPL( CvStatus, icvNot_8u_C1R, ( const uchar* src1, int step1, uchar* dst, int step, CvSize size ), (src1, step1, dst, step, size) ) argument [all...] |
/external/libxml2/ |
H A D | pattern.c | 92 int flags; /* properties of that step */ 114 int *states; /* the array of step indexes */ 141 int step; member in struct:_xmlStepState 342 * Add a step to an XSLT Compiled Match 464 xmlPatPushState(xmlStepStates *states, int step, xmlNodePtr node) { argument 480 states->states[states->nbstates].step = step; 483 fprintf(stderr, "Push: %d, %s\n", step, node->name); 500 xmlStepOpPtr step; local 507 step 1580 xmlStepOp step; local 1862 xmlStreamStep step; local [all...] |
/external/clang/test/SemaCXX/ |
H A D | for-range-examples.cpp | 30 T it, step; member in class:value_range_detail::value_range_step_iter 32 value_range_step_iter(const T &it, const T &step) : it(it), step(step) {} argument 35 value_range_step_iter &operator++() { it += step; return *this; } 40 T it, step, end_; member in class:value_range_detail::value_range_step 42 value_range_step(const T &it, const T &end, const T &step) : argument 43 it(it), end_(end), step(step) {} 45 iterator begin() const { return iterator(it, step); } 54 range(const T &a, const T &b, const T &step) argument [all...] |
/external/opencv/otherlibs/highgui/ |
H A D | grfmt_bmp.h | 64 bool ReadData( uchar* data, int step, int color ); 86 bool WriteImage( const uchar* data, int step,
|
H A D | grfmt_png.h | 60 bool ReadData( uchar* data, int step, int color ); 82 bool WriteImage( const uchar* data, int step,
|
H A D | grfmt_pxm.h | 57 bool ReadData( uchar* data, int step, int color ); 81 bool WriteImage( const uchar* data, int step,
|
H A D | grfmt_sunras.h | 70 bool ReadData( uchar* data, int step, int color ); 93 bool WriteImage( const uchar* data, int step,
|
H A D | grfmt_exr.h | 65 bool ReadData( uchar* data, int step, int color ); 73 void ChromaToBGR( float *data, int numlines, int step ); 95 bool WriteImage( const uchar* data, int step,
|
H A D | grfmt_bmp.cpp | 187 bool GrFmtBmpReader::ReadData( uchar* data, int step, int color ) argument 204 data += (m_height - 1)*step; 205 step = -step; 227 for( y = 0; y < m_height; y++, data += step ) 241 for( y = 0; y < m_height; y++, data += step ) 307 data = FillUniColor( data, line_end, step, width3, 311 data = FillUniGray( data, line_end, step, width3, 329 for( y = 0; y < m_height; y++, data += step ) 359 data = FillUniColor( data, line_end, step, width 493 WriteImage( const uchar* data, int step, int width, int height, int , int channels ) argument [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
H A D | FixedPointUtil.java | 54 int step = 1 << bit; 55 for (int i = step; i < n; i += (step << 1)) 57 lookupTable[i] = lookupTable[i - step].add(pow2);
|
/external/mesa3d/src/gallium/auxiliary/gallivm/ |
H A D | lp_bld_flow.h | 125 LLVMValueRef step); 130 LLVMValueRef step, 144 LLVMValueRef step; member in struct:lp_build_for_loop_state 156 LLVMValueRef step);
|
/external/skia/tests/ |
H A D | PathOpsCubicLineIntersectionIdeas.cpp | 54 static double binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t, argument 56 double firstStep = step; 66 if (step == 0) { 67 SkDebugf("binary search failed: step=%1.9g cubic=", firstStep); 74 double lastStep = step; 75 step /= 2; 80 // use larger x/y difference to choose step 82 t -= step; 92 t += step; 205 double step [all...] |
/external/deqp/framework/randomshaders/ |
H A D | rsgUtils.hpp | 53 inline float getQuantizedFloat (de::Random& rnd, float min, float max, float step) argument 55 int numSteps = (int)((max-min)/step); 56 return min + step*rnd.getInt(0, numSteps);
|
/external/linux-tools-perf/src/tools/perf/arch/x86/util/ |
H A D | header.c | 26 int family = -1, model = -1, step = -1; local 41 step = a & 0xf; 51 nb = scnprintf(buffer, sz, "%s,%u,%u,%u$", vendor, family, model, step);
|
/external/lzma/CPP/7zip/Common/ |
H A D | MethodProps.cpp | 22 const UInt32 step = (reducedDictionarySize >> 1);
local 28 reducedDictionarySize += step;
36 reducedDictionarySize += step;
|
/external/valgrind/gdbserver_tests/ |
H A D | mcbreak.stdoutB.exp | 8 old_pc has changed after step 10 old_pc has changed after step 13 old_pc has changed after step 19 old_pc has changed after step 21 old_pc has changed after step 50 old_pc has changed after step
|