/external/icu4c/test/intltest/ |
H A D | numfmtst.h | 258 void checkRounding(DecimalFormat* df, double base, int iterations, double increment);
|
/external/netperf/ |
H A D | netcpu_pstatnew.c | 151 calibrate_idle_rate(int iterations, int interval) argument
|
H A D | netcpu_kstat10.c | 299 calibrate_idle_rate(int iterations, int interval) argument
|
H A D | netcpu_ntperf.c | 145 calibrate_idle_rate(int iterations, int interval) argument
|
/external/webkit/Source/WebKit/android/content/ |
H A D | address_detector.cpp | 362 size_t iterations = 0; local 364 for (; it_ != end_ && iterations < max_iterations; ++iterations) { 480 if (iterations >= max_iterations)
|
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
H A D | OutputHLSL.cpp | 1556 // Handle loops with more than 255 iterations (unsupported by D3D9) by splitting them 1672 int iterations = (limit - initial + 1) / increment; local 1674 if (iterations <= 255) 1679 while (iterations > 0) 1682 int clampedLimit = initial + increment * std::min(255, iterations) - 1 - remainder; 1711 iterations -= 255;
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | dfa.rb | 226 | The prediction loop has exceeded a maximum limit of 50000 iterations 290 | The prediction loop has exceeded a maximum limit of 50000 iterations
|
/external/webkit/Tools/Scripts/webkitpy/tool/commands/ |
H A D | queues.py | 69 make_option("--exit-after-iteration", action="store", type="int", dest="iterations", default=None, help="Stop running the queue after iterating this number of times."), 125 return not self._options.iterations or self._iteration_count <= self._options.iterations
|
H A D | queues_unittest.py | 86 queue._options.iterations = 3
|
/external/chromium/chrome/common/extensions/docs/examples/extensions/proxy_configuration/test/ |
H A D | jsunittest.js | 955 DrNicTest.Unit.Testcase.prototype.benchmark = function(operation, iterations) { 957 (iterations || 1).times(operation); 960 iterations + ' iterations in ' + (timeTaken/1000)+'s' );
|
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
H A D | HashtableTest.java | 472 final int iterations = 10000; 476 for (int i = 0; i < iterations; i++) { 484 for (int i = 0; i < iterations; i++) {
|
H A D | VectorTest.java | 418 final int iterations = 10000; 422 for (int i = 0; i < iterations; i++) { 431 for (int i = 0; i < iterations; i++) {
|
/external/webkit/Tools/Scripts/ |
H A D | old-run-webkit-tests | 146 my $iterations = 1; 292 --iterations n Number of times to run the set of tests (e.g. ABCABCABC) 340 'iterations=i' => \$iterations, 673 print " $iterations times" if ($iterations > 1); 692 for (my $i = 1; $i < $iterations; $i++) {
|
/external/opencv/cv/include/ |
H A D | cv.h | 328 int iterations CV_DEFAULT(1) ); 334 int iterations CV_DEFAULT(1) ); 345 int operation, int iterations CV_DEFAULT(1) ); 484 Also it does several iterations to get optical flow for 1358 /* updates the number of RANSAC iterations */
|
/external/opencv/cvaux/src/ |
H A D | cvlmeds.cpp | 936 int iterations, error = 0, jN, iN, kN, lN = 0; local 943 /* max_iterations - maximum number QR-iterations 1182 iterations = 0; 1264 /* Completion iterations: lower block 1267 if( iterations++ == max_iterations )
|
/external/ceres-solver/docs/ |
H A D | build.tex | 107 This runs Ceres for a maximum of 10 iterations using the \denseschur\ linear solver. The output should look something like this. 137 Number of iterations:
|
H A D | powell.tex | 100 It is easy to see that the optimal solution to this problem is at $x_1=0, x_2=0, x_3=0, x_4=0$ with an objective function value of $0$. In 10 iterations, Ceres finds a solution with an objective function value of $4\times 10^{-12}$.
|
H A D | solving.tex | 210 ones corresponding to the minimum cost over all iterations. 454 iterations for Levenberg-Marquardt. 593 Minimum number of iterations used by the linear solver. This only 598 Minimum number of iterations used by the linear solver. This only 606 uses it to terminate the iterations when 669 \item{\texttt{lsqp\_iterations\_to\_dump }} List of iterations at
|
/external/chromium/base/third_party/nspr/ |
H A D | prtime.cc | 536 int iterations = 0; local 544 if (iterations++ > 1000)
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | OrderingTest.java | 528 int iterations, int elements, int seeds) { 532 for (int i = 0; i < iterations; i++) { 527 runLeastOfComparison( int iterations, int elements, int seeds) argument
|
/external/icu4c/test/perf/howExpensiveIs/ |
H A D | howExpensiveIs.cpp | 59 fprintf(stderr, "** Standard sieve time: %.9fs +/- %.9fs (%d iterations)\n", s,m, (int)U_LOTS_OF_TIMES); 150 * @return number of iterations 177 uint32_t iterations = ITERATIONS; local 178 *subTime = uprv_getMeanTime(times,&iterations,marginOfError); 219 fprintf(out, " <test name=\"%s\" standardizedTime=\"%f\" realDuration=\"%f\" marginOfError=\"%f\" iterations=\"%d\" />\n",
|
/external/yaffs2/yaffs2/ |
H A D | yaffs_guts.c | 2028 int iterations; local 2074 iterations = 2077 iterations = 2079 iterations = iterations / 16; 2080 if (iterations > 200) { 2081 iterations = 200; 2085 for (i = 0; i <= iterations && pagesInUse > 0 && !prioritised; i++) {
|
/external/icu4c/i18n/ |
H A D | decNumber.c | 5213 /* with the main difference being that the iterations in the series */ 5220 /* code does not precalculate the number of iterations and so cannot */ 5239 /* iterations by appoximately a third with additional (although */ 5249 /* which dominates when the number of iterations is small (less */ 5296 Int iterations=0; /* for later sanity check */ local 5424 /* the additions on the second and subsequent iterations are */ 5465 iterations++; 5483 if (iterations>p+3) 5484 printf("Exp iterations=%ld, status=%08lx, p=%ld, d=%ld\n", 5485 (LI)iterations, (L 5648 Int iterations=0; /* for later sanity check */ local [all...] |
/external/blktrace/btreplay/doc/ |
H A D | btreplay.tex | 392 [ -I <iters>: --iterations=<iters> ] Default: 1 458 \texttt{--iterations}\\Set Number of Iterations to Run}
|
/external/libvpx/libvpx/vp8/common/ppc/ |
H A D | loopfilter_filters_altivec.asm | 92 ;# 4 iterations of the cyclic transform 0->1->2->3->4->5->6->7->0. 236 ;# This can be accomplished by 4 iterations of the cyclic transform
|