HomeSort by relevance Sort by last modified time
    Searched full:iterations (Results 576 - 600 of 911) sorted by null

<<21222324252627282930>>

  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
VectorTest.java 418 final int iterations = 10000; local
422 for (int i = 0; i < iterations; i++) {
431 for (int i = 0; i < iterations; i++) {
    [all...]
  /dalvik/hit/src/com/android/hit/
HprofParser.java 602 * using as many iterations as needed.
  /development/samples/AccelerometerPlay/src/com/example/android/accelerometerplay/
AccelerometerPlayActivity.java 268 // We do no more than a limited number of iterations
  /development/tools/labpretest/
labpretest.sh 119 log_print "device time out after $loop iterations"
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3tokenstream.h 208 * a huge overhead as it only stores pointers anyway, but allows for iterations and
  /external/chromium/chrome/browser/safe_browsing/
filter_false_positive_perftest.cc 29 // --filter-steps: The number of iterations to run, with each iteration
  /external/chromium/sdch/open-vcdiff/src/
blockhash.cc 336 // number of iterations in FindBestMatch. For example, if the entire
  /external/chromium_org/chrome/browser/extensions/api/alarms/
alarm_manager.cc 368 // upcoming iterations, and (b) with indices so that if the last
  /external/chromium_org/chrome/renderer/safe_browsing/
phishing_dom_feature_extractor.cc 68 // The number of iterations we've done for the current extraction.
  /external/chromium_org/courgette/
courgette_tool.cc 455 // '-repeat=N' is for debugging. Running many iterations can reveal leaks and
  /external/chromium_org/mojo/system/
raw_channel_posix_unittest.cc 196 LOG(ERROR) << "Too many iterations.";
  /external/chromium_org/sdch/open-vcdiff/src/
blockhash.cc 337 // number of iterations in FindBestMatch. For example, if the entire
  /external/chromium_org/third_party/WebKit/Source/core/frame/animation/
AnimationBase.cpp 428 // There is no need to worry about iterations, we assume that we would have
  /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
fixed-dtoa.cc 253 // Therefore three iterations of this loop will not overflow fractionals
  /external/chromium_org/third_party/icu/source/test/intltest/
tsnmfmt.cpp 337 errMsg = ("**** FAIL: No string and/or number match within 2 iterations.");
  /external/chromium_org/third_party/re2/util/
sparse_array.h 154 // Can sort the sparse array so that future iterations
  /external/chromium_org/third_party/skia/src/core/
SkEdgeClipper.cpp 249 // This is a lot of iterations. Is there a faster way?
  /external/chromium_org/third_party/skia/src/opts/
SkBitmapProcState_matrix_repeat_neon.h 378 count -= 8; /* 8 iterations */
  /external/chromium_org/third_party/sqlite/src/test/
fuzz.test 29 # If running quick.test, don't do so many iterations.
  /external/chromium_org/v8/src/
date.cc 305 // but give up if we don't find it in four iterations.
fixed-dtoa.cc 254 // Therefore three iterations of this loop will not overflow fractionals
  /external/guava/guava/src/com/google/common/math/
BigIntegerMath.java 226 * with each iteration, so this algorithm takes O(log(digits)) iterations.
  /external/icu4c/test/intltest/
tsnmfmt.cpp 348 errMsg = ("**** FAIL: No string and/or number match within 2 iterations.");
  /external/libvpx/libvpx/vp8/common/x86/
subpixel_mmx.asm 189 ; the subsequent iterations repeat 3 out of 4 of these reads. Since the
  /external/libvpx/libvpx/vp9/encoder/
vp9_ratectrl.c 77 // quantizer value is adjusted between loop iterations.

Completed in 860 milliseconds

<<21222324252627282930>>