| /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/stress/ |
| MediaRecorderStressTest.java | 170 int iterations; local
199 iterations = MediaRecorderStressTestRunner.mIterations;
204 mOutput.write("Total number of loops: " + iterations + "\n");
208 for (int i = 0; i < iterations; i++) {
220 Log.v(TAG, "iterations : " + iterations);
|
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
| KeyFactory2Test.java | 51 int sleepTime, iterations; field in class:KeyFactory2Test.KeepAlive
53 public KeepAlive(int sleepTime, int iterations) {
55 this.iterations = iterations;
62 for (int i = 0; i < iterations; i++) {
|
| /system/extras/cpustats/ |
| cpustats.c | 52 static int cpu_count, delay, iterations; variable
74 iterations = -1;
85 iterations = atoi(argv[++i]);
136 while ((iterations == -1) || (iterations-- > 0)) {
423 fprintf(stderr, "Usage %s [ -n iterations ] [ -d delay ] [ -c cpu ] [ -m ] [ -h ]\n"
|
| /external/eigen/bench/spbench/ |
| spbenchsolver.h | 77 int iterations; member in struct:Stats
83 int MaximumIters; // Maximum number of iterations
195 stat.iterations = solver.iterations();
211 cout << " (" << stat[solver_id].iterations << ") \n";
233 cout << " (" << stat[solver_id].iterations << ") ";
263 error << " (" << stat[i].iterations << ") ";
273 error << " (" << stat[i].iterations << ") ";
490 MaximumIters = maxiters; // Maximum number of iterations, global variable
|
| /external/ceres-solver/docs/ |
| helloworld.tex | 66 Ceres Solver Report: Iterations: 2, Initial cost: 1.250000e+01, \
71 Starting from a $x=5$, the solver in two iterations goes to 10~\footnote{Actually the solver ran for three iterations, and it was by looking at the value returned by the linear solver in the third iteration, it observed that the update to the parameter block was too small and declared convergence. Ceres only prints out the display at the end of an iteration, and terminates as soon as it detects convergence, which is why you only see two iterations here and not three.}. The careful reader will note that this is a linear problem and one linear solve should be enough to get the optimal value. The default configuration of the solver is aimed at non-linear problems, and for reasons of simplicity we did not change it in this example. It is indeed possible to obtain the solution to this problem using Ceres in one iteration. Also note that the solver did get very close to the optimal function value of 0 in the very first iteration. We will discuss these issues in greater detail when we talk about convergence and parameter settings for Ceres.
|
| /external/chromium/sdch/open-vcdiff/src/ |
| addrcache_test.cc | 53 void BM_CacheEncode(int iterations, int test_size);
54 void BM_CacheDecode(int iterations, int test_size);
562 void VCDiffAddressCacheTest::BM_CacheEncode(int iterations, int test_size) {
565 for (int test_iteration = 0; test_iteration < iterations; ++test_iteration) {
587 void VCDiffAddressCacheTest::BM_CacheDecode(int iterations, int test_size) {
589 for (int test_iteration = 0; test_iteration < iterations; ++test_iteration) {
|
| /external/open-vcdiff/src/ |
| addrcache_test.cc | 53 void BM_CacheEncode(int iterations, int test_size);
54 void BM_CacheDecode(int iterations, int test_size);
562 void VCDiffAddressCacheTest::BM_CacheEncode(int iterations, int test_size) {
565 for (int test_iteration = 0; test_iteration < iterations; ++test_iteration) {
587 void VCDiffAddressCacheTest::BM_CacheDecode(int iterations, int test_size) {
589 for (int test_iteration = 0; test_iteration < iterations; ++test_iteration) {
|
| /external/v8/benchmarks/ |
| navier-stokes.js | 142 for (var k=0 ; k<iterations; k++) {
179 for (var k=0 ; k<iterations; k++) {
339 this.iterations = function() { return iterations; }
342 iterations = iters;
347 var iterations = 10;
|
| /external/v8/test/mjsunit/ |
| sparse-array-reverse.js | 71 for (var iterations = 0; iterations < 20; iterations++) {
|
| strict-mode-opt.js | 56 fail("ReferenceError after MAX iterations", "no exception");
102 fail("ReferenceError after MAX iterations", "no exception");
|
| /system/extras/tests/sdcard/ |
| plot_sdcard.py | 93 self.iterations = 0
105 elif line.startswith('# Iterations'):
106 self.iterations = int(re.search('# Iterations: ([0-9]+)', line).group(1))
190 readers will go thru 100 iterations much faster than the
192 iterations of the writers will likely be done w/o any influence from
203 gp.xlabel('iterations')
210 dataset.RescaleTo(metadata.iterations)
|
| /external/ceres-solver/include/ceres/ |
| solver.h | 154 // ones corresponding to the minimum cost over all iterations.
158 // Maximum number of iterations for the minimizer to run for.
390 // Minimum number of iterations for which the linear solver should
394 // Maximum number of iterations for which the linear solver should
405 // it to terminate the iterations when
432 // List of iterations at which the optimizer should dump the
585 vector<IterationSummary> iterations; member in struct:ceres::Solver::Summary
|
| /external/chromium/crypto/ |
| symmetric_key_win.cc | 241 size_t iterations,
283 for (size_t iteration = 2; iteration <= iterations; ++iteration) {
358 size_t iterations,
444 if (!ComputePBKDF2Block(prf, hLen, salt, iterations, block_index,
|
| /external/qemu/distrib/sdl-1.2.15/test/ |
| testblitspeed.c | 363 Uint32 iterations = 0; local
388 iterations++;
403 (int) iterations,
405 (int) (((float)iterations) / (((float)elasped) / 1000.0f)));
|
| /external/openfst/src/test/ |
| weight-tester.h | 39 void Test(int iterations, bool test_division = true) {
40 for (int i = 0; i < iterations; ++i) {
|
| /external/valgrind/main/drd/tests/ |
| annotate_smart_pointer.cpp | 309 const int iterations = std::max(argc > 2 ? atoi(argv[2]) : 1, 1); local
312 for (int j = 0; j < iterations; ++j)
|
| /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/ |
| lattice_neon.S | 53 @ Number of loop iterations after unrolling: r5 = (HALF_SUBFRAMELEN - 1) >> 2
61 @ First r5 iterations in a loop.
|
| /system/core/toolbox/ |
| top.c | 88 static int max_procs, delay, iterations, threads; variable
118 iterations = -1;
136 iterations = atoi(argv[++i]);
183 while ((iterations == -1) || (iterations-- > 0)) {
563 fprintf(stderr, "Usage: %s [ -m max_procs ] [ -n iterations ] [ -d delay ] [ -s sort_column ] [ -t ] [ -h ]\n"
|
| /external/llvm/lib/CodeGen/ |
| ShrinkWrapping.cpp | 73 None, BasicInfo, Iterations, Details
82 clEnumVal(Iterations, "print SR sets for each iteration"),
130 // Initialize shrink wrapping DFA sets, called before iterations.
282 unsigned iterations = 0; local
285 ++iterations;
306 << "iterations = " << iterations << "\n"
604 DEBUG(if (ShrinkWrapDebugging >= Iterations)
620 DEBUG(if (ShrinkWrapDebugging >= Iterations)
658 DEBUG(if (ShrinkWrapDebugging >= Iterations)
801 unsigned iterations = 0; local
[all...] |
| /external/guava/guava-tests/test/com/google/common/base/ |
| SuppliersTest.java | 350 final int iterations = 1000; local
355 for (int j = 0; j < iterations; j++) {
368 assertEquals(numThreads * iterations + 1, (int) nonThreadSafe.get());
|
| /external/valgrind/unittest/ |
| bigtest.cc | 177 int iterations = 0; local
178 Vector params = EstimateParameters(*cost_m, *stats, 0.0005, &iterations);
186 printf("Parameters (estimated in %d steps) :\n", iterations);
575 const int ITERATIONS = 16;
578 for (int i = 1; i <= ITERATIONS; i++) {
591 const int ITERATIONS = 16;
594 for (int i = 1; i <= ITERATIONS; i++) {
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IterativeSolverBase.h | 135 /** \returns the max number of iterations */
141 /** Sets the max number of iterations */
148 /** \returns the number of iterations performed during the last solve */
149 int iterations() const function in class:Eigen::IterativeSolverBase
189 /** \returns Success if the iterations converged, and NoConvergence otherwise. */
|
| /external/jmonkeyengine/engine/src/core/com/jme3/animation/ |
| SkeletonControl.java | 332 int iterations = (int) FastMath.ceil(fvb.capacity() / ((float) posBuf.length)); local
334 for (int i = iterations - 1; i >= 0; i--) {
442 int iterations = (int) FastMath.ceil(fvb.capacity() / ((float) posBuf.length)); local
445 for (int i = iterations - 1; i >= 0; i--) {
|
| /external/netperf/ |
| netcpu_procstat.c | 112 calibrate_idle_rate (int iterations, int interval)
|
| /frameworks/base/core/tests/coretests/src/android/os/ |
| PerformanceCollectorTest.java | 467 ArrayList<Parcelable> iterations = timing.getParcelableArrayList( local
469 assertNotNull(iterations);
470 assertEquals(labels.size(), iterations.size());
472 Bundle iteration = (Bundle)iterations.get(i);
|
