| /external/ceres-solver/internal/ceres/ |
| line_search_minimizer.cc | 163 summary->iterations.push_back(iteration_summary);
216 summary->message = "Maximum number of iterations reached.";
232 iteration_summary.iteration = summary->iterations.back().iteration + 1;
318 "a valid step size, (did not run out of iterations) "
378 summary->iterations.push_back(iteration_summary);
|
| solver.cc | 393 "Iterations: %d, "
498 "Use inner iterations %20s %20s\n",
556 StringAppendF(&report, "\nMinimizer iterations % 16d\n",
569 StringAppendF(&report, "Steps with inner iterations % 14d\n",
588 StringAppendF(&report, " Inner iterations %23.3f\n",
|
| /external/eigen/bench/spbench/ |
| spbenchsolver.h | 80 int MaximumIters; // Maximum number of iterations
297 statbuf << " <ITER> "<< solver.iterations() << "</ITER>\n";
299 std::cout << "ITERATIONS : " << solver.iterations() <<"\n\n\n";
492 MaximumIters = maxiters; // Maximum number of iterations, global variable
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| autotuned_index.h | 229 get_param<int>(cost.params,"iterations"),
290 // c.params["max-iterations"] = params[1];
339 cost.params["iterations"] = maxIterations[i];
355 // kmeansNMPoints[i*n+1] = (int)kmeansCosts[i].params["max-iterations"];
364 // kmeansCosts[i].params["max-iterations"] = kmeansNMPoints[i*2+1];
|
| /frameworks/base/tools/layoutlib/bridge/tests/src/com/android/layoutlib/bridge/intensive/ |
| ImageUtils.java | 238 // about 3-4 iterations to get the result since we are logarithmically reducing
258 int iterations = 0; // Number of halving operations to perform after the initial resize local
264 iterations++;
279 for (int iteration = iterations - 1; iteration >= 0; iteration--) {
292 iterations--;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/exception/util/ |
| LocalizedFormats.java | 98 FAILED_BRACKETING("number of iterations={0}, maximum iterations={1}, initial={2}, lower bound={3}, upper bound={4}, final a value={5}, final b value={6}, f(a)={7}, f(b)={8}"),
99 FAILED_FRACTION_CONVERSION("Unable to convert {0} to fraction after {1} iterations"),
129 INVALID_MAX_ITERATIONS("bad value for maximum iterations number: {0}"),
141 MAX_ITERATIONS_EXCEEDED("maximal number of iterations ({0}) exceeded"),
152 NEGATIVE_ROBUSTNESS_ITERATIONS("the number of robustness iterations must be non-negative, but got {0}"),
277 UNABLE_TO_ORTHOGONOLIZE_MATRIX("unable to orthogonalize matrix in {0} iterations"),
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| RealSchur.h | 158 * iterations with implicit double shift. The cost of computing the Schur
159 * decomposition depends on the number of iterations; as a rough guide, it
199 /** \brief Sets the maximum number of iterations allowed.
201 * If not specified by the user, the maximum number of iterations is m_maxIterationsPerRow times the size
210 /** \brief Returns the maximum number of iterations. */
216 /** \brief Maximum number of iterations per row.
218 * If not otherwise specified, the maximum number of iterations is this number times the size of the
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
| LocaleMatcherTest.java | 583 int iterations = i == 0 ? 1000 : 100000; local
585 long timeShort = timeLocaleMatcher("Duration (few supported):\t", desired, matcherShort, showMessage, iterations, 0);
587 long timeMedium = timeLocaleMatcher("Duration (med. supported):\t", desired, matcherLong, showMessage, iterations, timeShort);
589 long timeLong = timeLocaleMatcher("Duration (many supported):\t", desired, matcherVeryLong, showMessage, iterations, timeShort);
594 boolean showmessage, int iterations, long comparisonTime) {
596 for (int i = iterations; i > 0; --i) {
600 if (showmessage) warnln(title + (delta / iterations) + " nanos, "
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| LocaleMatcherTest.java | 579 int iterations = i == 0 ? 1000 : 100000; local
581 long timeShort = timeLocaleMatcher("Duration (few supported):\t", desired, matcherShort, showMessage, iterations, 0);
583 long timeMedium = timeLocaleMatcher("Duration (med. supported):\t", desired, matcherLong, showMessage, iterations, timeShort);
585 long timeLong = timeLocaleMatcher("Duration (many supported):\t", desired, matcherVeryLong, showMessage, iterations, timeShort);
590 boolean showmessage, int iterations, long comparisonTime) {
592 for (int i = iterations; i > 0; --i) {
596 if (showmessage) warnln(title + (delta / iterations) + " nanos, "
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 141 /// iterations via an early branch, but control may not exit the loop from the
142 /// LatchBlock's terminator prior to TripCount iterations.
150 /// iterations before branching into the unrolled loop. UnrollLoop will not
203 // Effectively "DCE" unrolled iterations that are beyond the tripcount
262 Twine(TripCount) + " iterations");
419 // Now that all the basic blocks for the unrolled iterations are in place,
443 // unconditional branch for some iterations.
|
| /external/valgrind/memcheck/tests/ |
| vcpu_fbench.c | 100 normalised as if run for 1000 iterations.
306 #ifndef ITERATIONS
307 #define ITERATIONS /*1000*/ /*500000*/ 100
309 int niter = ITERATIONS; /* Iteration counter */
723 /* Process the number of iterations argument, if one is supplied. */
731 printf("where <itercount> is the number of iterations\n");
752 printf("and performance benchmark. %d iterations will be made.\n\n",
|
| /external/valgrind/perf/ |
| fbench.c | 96 normalised as if run for 1000 iterations.
302 #ifndef ITERATIONS
303 #define ITERATIONS /*1000*/ /*500000*/ 80000
305 int niter = ITERATIONS; /* Iteration counter */
719 /* Process the number of iterations argument, if one is supplied. */
727 printf("where <itercount> is the number of iterations\n");
748 printf("and performance benchmark. %d iterations will be made.\n\n",
|
| /system/core/toolbox/ |
| top.c | 90 static int max_procs, delay, iterations, threads; variable
118 iterations = -1;
136 iterations = atoi(argv[++i]);
183 while ((iterations == -1) || (iterations-- > 0)) {
191 if (iterations != 0) sleep(delay);
581 fprintf(stderr, "Usage: %s [ -m max_procs ] [ -n iterations ] [ -d delay ] [ -s sort_column ] [ -t ] [ -h ]\n"
|
| /external/autotest/site_utils/ |
| test_runner_utils.py | 100 parser.add_argument('--iterations', action='store', type=int, default=1,
442 iterations=1,
471 @param iterations: int number of times to schedule tests.
512 # Schedule the suites, looping over iterations if necessary.
513 for iteration in range(iterations):
611 iterations=1, fast_mode=False, debug=False,
641 @param iterations: int number of times to schedule tests.
677 iterations=iterations,
[all...] |
| /cts/tests/tests/hardware/src/android/hardware/cts/ |
| SensorIntegrationTests.java | 67 final int ITERATIONS = 50;
86 operation.add(new RepeatingSensorOperation(continuousOperation, ITERATIONS));
99 operation.add(new RepeatingSensorOperation(batchingOperation, ITERATIONS));
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| KMeansPlusPlusClusterer.java | 64 * algorithm iterations is to split the cluster with largest distance variance.
75 * may appear during algorithm iterations
88 * @param maxIterations the maximum number of iterations to run the algorithm
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LevenbergMarquardt.h | 180 /** \returns the number of iterations performed */
181 Index iterations() { return m_iter; } function in class:Eigen::LevenbergMarquardt
246 Index m_iter; // Number of iterations performed
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| SuppliersTest.java | 351 final int iterations = 1000; local
356 for (int j = 0; j < iterations; j++) {
369 assertEquals(numThreads * iterations + 1, (int) nonThreadSafe.get());
|
| /external/okhttp/okio/benchmarks/src/main/java/com/squareup/okio/benchmarks/ |
| BufferPerformanceBench.java | 52 @Warmup(iterations = 10, time = 10)
53 @Measurement(iterations = 10, time = 10)
91 * iterations as needed by JMH).
|
| /external/opencv3/doc/py_tutorials/py_ml/py_kmeans/py_kmeans_opencv/ |
| py_kmeans_opencv.markdown | 20 - **cv2.TERM_CRITERIA_MAX_ITER** - stop the algorithm after the specified number of iterations, *max_iter*.
22 -# max_iter - An integer specifying maximum number of iterations.
69 that, whenever 10 iterations of algorithm is ran, or an accuracy of epsilon = 1.0 is reached, stop
|
| /external/opencv3/modules/calib3d/src/ |
| rho.h | 171 * - The maximum number of PROSAC iterations. This corresponds to the
175 * iterations after which PROSAC will start sampling like RANSAC.
229 * @param [in] maxI The maximum number of PROSAC iterations.
|
| /frameworks/base/core/java/android/test/ |
| InstrumentationTestCase.java | 232 Bundle iterations = new Bundle(); local
233 iterations.putInt("currentiterations", runCount);
234 getInstrumentation().sendStatus(2, iterations);
|
| /frameworks/rs/java/tests/ImageProcessing/src/com/android/rs/image/ |
| ImageProcessingTest.java | 38 private final String ITERATIONS = "Iterations";
109 results.putInt(ITERATIONS, mIteration);
|
| /frameworks/rs/java/tests/ImageProcessing_jb/src/com/android/rs/image/ |
| ImageProcessingTest.java | 39 private final String ITERATIONS = "Iterations";
124 results.putInt(ITERATIONS, mIteration);
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/opp/ |
| BluetoothOppReceiveFileInfo.java | 220 * avoid collisions. It starts at 1. The next 9 iterations increment it
221 * by 1 at a time (up to 10). The next 9 iterations increment it by 1 to
222 * 10 (random) at a time. The next 9 iterations increment it by 1 to 100
|
