/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ConcurrentHashMultisetBasherTest.java | 113 int iterations = 100000; 117 for (int i = 0; i < iterations; i++) {
|
/external/netperf/ |
H A D | netcpu_looper.c | 480 /* Loop a number of iterations, sleeping interval seconds each and */ 485 calibrate_idle_rate (int iterations, int interval) 509 if (iterations > MAXTIMES) { 510 iterations = MAXTIMES; 515 for(i = 0; i < iterations; i++) { 484 calibrate_idle_rate(int iterations, int interval) argument
|
H A D | netcpu_osx.c | 97 calibrate_idle_rate(int iterations, int interval) argument
|
H A D | netcpu_procstat.c | 112 calibrate_idle_rate (int iterations, int interval) argument
|
/external/yaffs2/yaffs2/direct/ |
H A D | dtest.c | 171 int iterations = (syze + strlen(fn) -1)/ strlen(fn); local 175 while (iterations > 0) 177 sprintf(xx,"%s %8d",fn,iterations); 179 iterations--; 193 int iterations = (syze + strlen(fn) -1)/ strlen(fn); local 197 while (iterations > 0) 199 sprintf(xx,"%s %8d",fn,iterations); 208 iterations--; 219 int iterations; local 223 iterations [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | trust_region_minimizer.cc | 204 summary->iterations.push_back(iteration_summary); 227 VLOG(1) << "Terminating: Maximum number of iterations reached."; 240 iteration_summary = summary->iterations.back(); 241 iteration_summary.iteration = summary->iterations.back().iteration + 1; 314 summary->iterations.back().gradient_max_norm; 536 summary->iterations.push_back(iteration_summary);
|
/external/smack/src/org/xbill/DNS/ |
H A D | Lookup.java | 43 private int iterations; field in class:Lookup 184 iterations = 0; 392 iterations++; 393 if (iterations >= 6 || name.equals(oldname)) { 425 if (iterations > 0) {
|
/external/eigen/bench/spbench/ |
H A D | 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/ |
H A D | helloworld.tex | 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/ |
H A D | 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) { argument 565 for (int test_iteration = 0; test_iteration < iterations; ++test_iteration) { 587 void VCDiffAddressCacheTest::BM_CacheDecode(int iterations, int test_size) { argument 589 for (int test_iteration = 0; test_iteration < iterations; ++test_iteration) {
|
/external/open-vcdiff/src/ |
H A D | 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) { argument 565 for (int test_iteration = 0; test_iteration < iterations; ++test_iteration) { 587 void VCDiffAddressCacheTest::BM_CacheDecode(int iterations, int test_size) { argument 589 for (int test_iteration = 0; test_iteration < iterations; ++test_iteration) {
|
/external/chromium/crypto/ |
H A D | 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, 238 ComputePBKDF2Block(HCRYPTHASH hash, DWORD hash_size, const std::string& salt, size_t iterations, uint32 block_index, BYTE* output_buf) argument 355 DeriveKeyFromPassword(Algorithm algorithm, const std::string& password, const std::string& salt, size_t iterations, size_t key_size_in_bits) argument
|
/external/icu4c/tools/ctestfw/unicode/ |
H A D | uperf.h | 88 * e.g: Number of breaks / iterations for break iterator 164 int32_t iterations; member in class:UPerfTest
|
/external/qemu/distrib/sdl-1.2.15/test/ |
H A D | testblitspeed.c | 363 Uint32 iterations = 0; local 388 iterations++; 403 (int) iterations, 405 (int) (((float)iterations) / (((float)elasped) / 1000.0f)));
|
/external/openfst/src/test/ |
H A D | weight-tester.h | 39 void Test(int iterations, bool test_division = true) { argument 40 for (int i = 0; i < iterations; ++i) {
|
/external/valgrind/main/drd/tests/ |
H A D | 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/ |
H A D | lattice_neon.S | 53 @ Number of loop iterations after unrolling: r5 = (HALF_SUBFRAMELEN - 1) >> 2 61 @ First r5 iterations in a loop.
|
/external/llvm/lib/CodeGen/ |
H A D | ShrinkWrapping.cpp | 130 // Initialize shrink wrapping DFA sets, called before iterations. 282 unsigned iterations = 0; local 285 ++iterations; 306 << "iterations = " << iterations << "\n" 801 unsigned iterations = 0; local 808 ++iterations; 811 dbgs() << "iter " << iterations 817 // minimize the total iterations. 862 dbgs() << "total iterations [all...] |
/external/guava/guava-tests/test/com/google/common/base/ |
H A D | SuppliersTest.java | 350 final int iterations = 1000; 355 for (int j = 0; j < iterations; j++) { 368 assertEquals(numThreads * iterations + 1, (int) nonThreadSafe.get());
|
/external/valgrind/unittest/ |
H A D | 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);
|
/external/ceres-solver/include/ceres/ |
H A D | 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/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | 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/ |
H A D | SkeletonControl.java | 332 int iterations = (int) FastMath.ceil(fvb.capacity() / ((float) posBuf.length)); 334 for (int i = iterations - 1; i >= 0; i--) { 442 int iterations = (int) FastMath.ceil(fvb.capacity() / ((float) posBuf.length)); 445 for (int i = iterations - 1; i >= 0; i--) {
|
/external/aac/libAACenc/src/ |
H A D | qc_main.cpp | 153 AAC_ENCODER_ERROR FDKaacEnc_reduceBitConsumption(int* iterations, 894 INT iterations[(1)][(6)]; local 921 iterations[c][i] = 0 ; 967 FDKaacEnc_reduceBitConsumption(&iterations[c][i], 1124 emergencyIterations &= ((iterations[c][i] < hQC->maxIterations) ? 0 : 1); 1177 static AAC_ENCODER_ERROR FDKaacEnc_reduceBitConsumption(int* iterations, argument 1194 if ((*iterations)++ >= maxIterations) 1226 else /* iterations >= maxIterations */
|
/external/blktrace/btreplay/ |
H A D | btreplay.c | 101 * @iterations: Remaining iterations to process 113 int cpu, ifd, ofd, iterations; member in struct:thr_info 143 static int def_iterations = 1; // Default number of iterations 868 tip->iterations = def_iterations; 1338 while (!is_send_done(tip) && tip->iterations--) { 1341 fprintf(tip->vfp, "\n=== %d ===\n", tip->iterations); 1366 "\t[ -I <iters>: --iterations=<iters> ] Default: 1\n" \ 1409 .name = "iterations", 1505 "Invalid number of iterations [all...] |