HomeSort by relevance Sort by last modified time
    Searched refs:step (Results 251 - 275 of 1050) sorted by null

<<11121314151617181920>>

  /external/glide/third_party/gif_encoder/src/main/java/com/bumptech/glide/gifencoder/
NeuQuant.java 236 int radius, rad, alpha, step, delta, samplepixels; local
260 step = 3;
262 step = 3 * prime1;
265 step = 3 * prime2;
268 step = 3 * prime3;
270 step = 3 * prime4;
285 pix += step;
  /external/google-breakpad/src/testing/gtest/include/gtest/internal/
gtest-param-util.h 185 RangeGenerator(T begin, T end, IncrementT step)
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
201 IncrementT step)
202 : base_(base), value_(value), index_(index), step_(step) {}
244 const IncrementT& step) {
246 for (T i = begin; i < end; i = i + step)
  /external/gtest/include/gtest/internal/
gtest-param-util.h 185 RangeGenerator(T begin, T end, IncrementT step)
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
201 IncrementT step)
202 : base_(base), value_(value), index_(index), step_(step) {}
244 const IncrementT& step) {
246 for (T i = begin; i < end; i = i + step)
  /external/llvm/utils/unittest/googletest/include/gtest/internal/
gtest-param-util.h 185 RangeGenerator(T begin, T end, IncrementT step)
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
201 IncrementT step)
202 : base_(base), value_(value), index_(index), step_(step) {}
244 const IncrementT& step) {
246 for (T i = begin; i < end; i = i + step)
  /external/mesa3d/src/gtest/include/gtest/internal/
gtest-param-util.h 185 RangeGenerator(T begin, T end, IncrementT step)
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
201 IncrementT step)
202 : base_(base), value_(value), index_(index), step_(step) {}
244 const IncrementT& step) {
246 for (T i = begin; i < end; i = i + step)
  /external/opencv/cxcore/src/
cxmathfuncs.cpp 406 float* x_data = (float*)(xmat->data.ptr + xmat->step*y);
407 float* y_data = (float*)(ymat->data.ptr + ymat->step*y);
408 float* mag_data = mag ? (float*)(mag->data.ptr + mag->step*y) : 0;
409 float* angle_data = angle ? (float*)(angle->data.ptr + angle->step*y) : 0;
435 double* x_data = (double*)(xmat->data.ptr + xmat->step*y);
436 double* y_data = (double*)(ymat->data.ptr + ymat->step*y);
437 double* mag_data = mag ? (double*)(mag->data.ptr + mag->step*y) : 0;
438 double* angle_data = angle ? (double*)(angle->data.ptr + angle->step*y) : 0;
649 float* x_data = (float*)(xmat ? xmat->data.ptr + xmat->step*y : 0);
650 float* y_data = (float*)(ymat ? ymat->data.ptr + ymat->step*y : 0)
    [all...]
  /external/protobuf/gtest/include/gtest/internal/
gtest-param-util.h 184 RangeGenerator(T begin, T end, IncrementT step)
186 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
200 IncrementT step)
201 : base_(base), value_(value), index_(index), step_(step) {}
243 const IncrementT& step) {
245 for (T i = begin; i < end; i = i + step)
  /ndk/sources/third_party/googletest/googletest/include/gtest/internal/
gtest-param-util.h 185 RangeGenerator(T begin, T end, IncrementT step)
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
201 IncrementT step)
202 : base_(base), value_(value), index_(index), step_(step) {}
244 const IncrementT& step) {
246 for (T i = begin; i < end; i = i + step)
  /frameworks/av/media/libstagefright/codecs/aacenc/src/
transform.c 194 int i, j, step; local
199 step = 2*bgn;
210 xptr += step;
218 xptr += step;
233 xptr += step;
252 xptr -= step;
256 xptr -= step;
260 xptr -= step;
266 xptr += 3*step;
268 twidTab += 3*step;
    [all...]
  /packages/apps/Bluetooth/tests/src/com/android/bluetooth/tests/
SapServerTest.java 256 * TODO: We need to add a IAction and add an action to a step, to be able to send
326 * Examine if the step has any expected response.
375 * Add a test step to the sequencer
378 * @return The created step index, which can be used when adding events or actions.
381 // TODO: should we add a step trigger? (in stead of just executing in sequence)
388 * Add a sub-step to a sequencer step. All requests added to the same index will be send to
391 * responses in the step will be searched for a match.
392 * @param index the index returned from addStep() to which the sub-step is to be added.
397 SeqStep step = sequence.get(index) local
    [all...]
  /frameworks/av/media/libstagefright/codecs/aacenc/src/asm/ARMV7/
Radix4FFT_v7.s 61 add r8, r8, r5 @ xptr += step@
72 add r8, r8, r5 @ xptr += step@
114 sub r8, r8, r5 @ xptr -= step@
119 sub r8, r8, r5 @ xptr -= step@
124 sub r8, r8, r5 @ xptr -= step@
  /external/opencv/cv/src/
cvfilter.cpp 537 dptr = dst->data.ptr + dst_origin.y*dst->step + dst_origin.x*CV_ELEM_SIZE(dst_type);
538 sptr = src->data.ptr + src_y1*src->step + src_x*pix_size;
545 delta = fill_cyclic_buffer( sptr, src->step, src_y, src_y1, src_y2 );
548 sptr += src->step*delta;
576 y_func( rows + max_ky - anchor.y, dptr, dst->step, count, this );
579 dptr += dst->step*count;
    [all...]
cvoptflowbm.cpp 599 if( srcA->step != srcB->step || velx->step != vely->step )
603 srcA->step, cvGetMatSize( srcA ), blockSize,
605 velx->data.fl, vely->data.fl, velx->step ));
  /external/opencv/otherlibs/highgui/
grfmt_tiff.cpp 165 bool GrFmtTiffReader::ReadData( uchar* data, int step, int color )
193 for( y = 0; y < m_height; y += tile_height0, data += step*tile_height0 )
218 data + x*3 + step*(tile_height - i - 1), 0,
222 data + x + step*(tile_height - i - 1), 0,
559 bool GrFmtTiffReader::ReadData( uchar* data, int step, int color )
594 for( ; y < y_limit; y++, data += step )
681 bool GrFmtTiffWriter::WriteImage( const uchar* data, int step,
687 assert( data && width > 0 && height > 0 && step >= fileStep);
727 for( ; y < limit; y++, data += step )
  /frameworks/av/media/mtp/
MtpProperty.cpp 239 void MtpProperty::setFormRange(int min, int max, int step) {
245 mStepSize.u.i8 = step;
250 mStepSize.u.u8 = step;
255 mStepSize.u.i16 = step;
260 mStepSize.u.u16 = step;
265 mStepSize.u.i32 = step;
270 mStepSize.u.u32 = step;
275 mStepSize.u.i64 = step;
280 mStepSize.u.u64 = step;
  /external/opencv/cv/include/
cvcompat.h 910 int step; \/* distance between lines ( in elements of single *\/ member in struct:_CvPixelPosition8u
925 int step; member in struct:_CvPixelPosition8s
938 int step; member in struct:_CvPixelPosition32f
    [all...]
  /cts/apps/CtsVerifier/src/com/android/cts/verifier/widget/
WidgetCtsProvider.java 183 int step = 1; local
185 step = sTestCount.get(widgetId) + 1;
190 title = "Step " + step + ": Verify dimensions";
196 title = "Step " + step + ": Verify resizeability";
209 title = "Step " + step + ": Verify collections";
213 title = "Step " + step + ": Verify category"
    [all...]
  /external/ceres-solver/internal/ceres/
dogleg_strategy.cc 74 // gradient) and the new Gauss-Newton step are computed from
75 // scratch. The Dogleg step is then computed as interpolation of these
81 double* step) {
84 CHECK_NOTNULL(step);
93 ComputeTraditionalDoglegStep(step);
97 ComputeSubspaceDoglegStep(step);
119 // || D * step || <= radius_ .
144 // Interpolate the Cauchy point and the Gauss-Newton step.
146 ComputeTraditionalDoglegStep(step);
150 // Cauchy point and the (Gauss-)Newton step
    [all...]
  /external/javasqlite/src/main/java/SQLite/
Database.java 310 while (ret.nrows < ret.maxrows && vm.step(ret)) {
314 while (vm.step(ret)) {
363 while (ret.nrows < ret.maxrows && vm.step(ret)) {
367 while (vm.step(ret)) {
416 while (tbl.nrows < tbl.maxrows && vm.step(tbl)) {
420 while (vm.step(tbl)) {
  /external/libvorbis/lib/
codebook.c 359 int step=n/book->dim; local
360 long *entry = alloca(sizeof(*entry)*step);
361 float **t = alloca(sizeof(*t)*step);
364 for (i = 0; i < step; i++) {
369 for(i=0,o=0;i<book->dim;i++,o+=step)
370 for (j=0;j<step;j++)
  /external/libvorbis/vq/
bookutil.c 25 int _best(codebook *book, float *a, int step){
37 for(i=0,o=step*(dim-1);i<dim;i++,o-=step){
43 for(i=0,o=step*(dim-1);i<dim;i++,o-=step){
60 float val=(e[j]-a[j*step]);
  /external/opencv/cvaux/src/
cvtexture.cpp 125 // roll together Directions and magnitudes together with knowledge of image (step)
307 // generate GLCM for each step
532 CV_IMPL double cvGetGLCMDescriptor( CvGLCM* GLCM, int step, int descriptor )
546 if( (unsigned)step >= (unsigned)(GLCM->numMatrices))
547 CV_ERROR( CV_StsOutOfRange, "step is not in 0 .. GLCM->numMatrices - 1" );
552 value = GLCM->descriptors[step][descriptor];
608 cvCreateGLCMImage( CvGLCM* GLCM, int step )
625 if( (unsigned)step >= (unsigned)(GLCM->numMatrices) )
626 CV_ERROR( CV_StsOutOfRange, "The step index is out of range" );
636 double matrixValue = GLCM->matrices[step][sideLoop1][sideLoop2]
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
UserString.py 163 start, stop, step = index.indices(len(self.data))
164 if step == -1:
167 elif step != 1:
170 raise TypeError, "invalid step in slicing assignment"
180 start, stop, step = index.indices(len(self.data))
181 if step == -1:
183 elif step != 1:
185 raise TypeError, "invalid step in slicing deletion"
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
UserString.py 163 start, stop, step = index.indices(len(self.data))
164 if step == -1:
167 elif step != 1:
170 raise TypeError, "invalid step in slicing assignment"
180 start, stop, step = index.indices(len(self.data))
181 if step == -1:
183 elif step != 1:
185 raise TypeError, "invalid step in slicing deletion"
  /external/opencv/ml/src/
mlem.cpp 139 CV_ERROR( CV_StsNullPtr, "Probabilities must be specified when EM algorithm starts with M-step" );
143 CV_ERROR( CV_StsNullPtr, "Mean's must be specified when EM algorithm starts with E-step" );
246 const double* mean_k = (const double*)(means->data.ptr + means->step*k);
247 const double* w = (const double*)(inv_eigen_values->data.ptr + inv_eigen_values->step*k);
370 int lstep = CV_IS_MAT_CONT(labels->type) ? 1 : labels->step/sizeof(int);
375 sample.data.ptr = _samples->data.ptr + _samples->step*idx;
376 prob.data.ptr = probs->data.ptr + probs->step*i;
504 dst.data.ptr = means->data.ptr + means->step*i;
625 const double* c = (double*)(centers->data.ptr + k*centers->step);
667 double* c = (double*)(centers->data.ptr + k*centers->step);
    [all...]

Completed in 536 milliseconds

<<11121314151617181920>>