| /packages/apps/Launcher2/tests/stress/src/com/android/launcher2/stress/ |
| LauncherRotationStressTest.java | 29 * Run rotation stress test using Launcher2 for 50 iterations.
|
| /cts/tests/tests/hardware/src/android/hardware/cts/helpers/sensoroperations/ |
| SensorOperationTest.java | 205 final int iterations = 10;
209 SensorOperation op = new RepeatingSensorOperation(subOp, iterations);
217 assertTrue(Math.abs(subOpDurationMs * iterations - duration) < TEST_DURATION_THRESHOLD_MS);
220 assertEquals(iterations, statsKeys.size());
221 for (int i = 0; i < iterations; i++) {
232 final int iterations = 100;
261 SensorOperation op = new RepeatingSensorOperation(subOp, iterations);
|
| /external/google-benchmark/ |
| README.md | 49 state.SetBytesProcessed(int64_t(state.iterations()) *
131 static_cast<int64_t>(state.iterations())*state.range_x());
234 Benchmark Time(ns) CPU(ns) Iterations
258 "iterations": 94877,
266 "iterations": 21609,
274 "iterations": 21393,
287 name,iterations,real_time,cpu_time,bytes_per_second,items_per_second,label
|
| /system/extras/latencytop/ |
| latencytop.c | 71 int delay, iterations; local
77 iterations = 0;
94 iterations = atoi(argv[++i]);
141 while ((iterations == 0) || (count++ < iterations)) {
421 fprintf(stderr, "Usage: %s [ -d delay ] [ -n iterations ] [ -p pid [ -t tid ] ] [ -h ]\n"
423 " -n iterations Number of updates to show (0 = infinite).\n"
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| DirectSearchOptimizer.java | 100 /** Maximal number of iterations allowed. */
103 /** Number of iterations already performed. */
104 private int iterations; field in class:DirectSearchOptimizer
238 return iterations;
284 iterations = 0;
292 if (iterations > 0) {
295 converged &= checker.converged(iterations, previous[i], simplex[i]);
311 /** Increment the iterations counter by 1.
313 * of iterations is exceeded
317 if (++iterations > maxIterations)
[all...] |
| /external/autotest/client/common_lib/ |
| test.py | 326 def execute(self, iterations=None, test_length=None, profile_only=None,
339 @param iterations: A number of iterations that we'll run the run_once
343 @param profile_only: If true run X iterations with profilers enabled.
344 If false run X iterations and one with profiling if profiles are
354 # profilers to run during the test iterations. Let's reserve only
362 # If the user called this test in an odd way (specified both iterations
364 if iterations and test_length:
365 logging.debug('Iterations parameter ignored (timed execution)')
384 logging.debug('Test finished after %d iterations, '
[all...] |
| /external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/src/ |
| timing-utilities.js | 26 iterations: 1,
137 return timing.duration * timing.iterations;
180 if (scaledActiveTime === Infinity || scaledActiveTime === -Infinity || (scaledActiveTime - startOffset == repeatedDuration && timing.iterations && ((timing.iterations + timing.iterationStart) % 1 == 0))) {
192 return timing.iterationStart + timing.iterations - 1;
|
| /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/icu/android_icu4j/src/main/tests/android/icu/dev/test/normalizer/ |
| TestCanonicalIterator.java | 83 int iterations = 10000; local
91 for (int i = 0; i < iterations; ++i) {
100 double slowDelta = (end-start) / iterations;
105 for (int i = 0; i < iterations; ++i) {
114 double fastDelta = (end-start) / iterations;
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/ |
| TestCanonicalIterator.java | 79 int iterations = 10000; local
87 for (int i = 0; i < iterations; ++i) {
96 double slowDelta = (end-start) / iterations;
101 for (int i = 0; i < iterations; ++i) {
110 double fastDelta = (end-start) / iterations;
|
| /external/mesa3d/src/glsl/ |
| loop_controls.cpp | 114 /* Make sure that the calculated number of iterations satisfies the exit
244 const int iterations = calculate_iterations(init, limit, local
247 if (iterations >= 0) {
251 if (iterations < max_iterations) {
258 max_iterations = iterations;
|
| /external/netperf/src/ |
| netcpu_pstat.c | 93 Loop a number of iterations, sleeping wait_time seconds each and
98 calibrate_idle_rate(int iterations, int interval)
126 if (iterations > MAXTIMES) {
127 iterations = MAXTIMES;
138 for(i = 0; i < iterations; i++) {
|
| /external/webrtc/webrtc/common_audio/signal_processing/ |
| min_max_operations_neon.c | 109 // Second part, do the remaining iterations (if any).
153 // Second part, do the remaining iterations (if any).
195 // Second part, do the remaining iterations (if any).
233 // Second part, do the remaining iterations (if any).
275 // Second part, do the remaining iterations (if any).
|
| /external/icu/icu4j/perf-tests/ |
| perftests.pl | 95 $jdkElement->setAttribute("iterations" => 1);
106 $icuElement->setAttribute("iterations" => 1);
139 $jdkElement->setAttribute("iterations"=>1);
149 $icuElement->setAttribute("iterations"=>1);
231 $ICU->setAttribute("iterations"=>1000);
238 $Key->setAttribute("iterations"=>1000);
245 $JDK->setAttribute("iterations"=>1000);
252 $Key->setAttribute("iterations"=>1000);
281 # @param if >0 then the number of iterations per pass. If <0 then
284 # @return a Dataset object, scaled by iterations per pass an
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/ |
| PoissonDistributionImpl.java | 37 * Default maximum number of iterations for cumulative probability calculations.
60 * Maximum number of iterations for cumulative probability.
85 * and maximum number of iterations.
89 * @param maxIterations the maximum number of iterations for cumulative probabilites
111 * Create a new Poisson distribution with the given mean and maximum number of iterations.
114 * @param maxIterations the maximum number of iterations for cumulative probabilites
|
| /external/autotest/tko/ |
| job_serializer_unittest.py | 171 self.check_iteration(test.iterations, newtest.iterations)
299 self.check_iteration(test.iterations, newtest.iterations)
324 def check_iteration(self, iterations, newiterations):
327 for iteration, newiteration in zip(iterations, newiterations):
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| MINRES.h | 26 * \param iters On input the max number of iteration, on output the number of performed iterations.
173 * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
174 * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations
186 * std::cout << "#iterations: " << mr.iterations() << std::endl;
192 * By default the iterations start with x=0 as an initial guess of the solution.
|
| /external/opencv3/modules/cudaoptflow/include/opencv2/ |
| cudaoptflow.hpp | 124 //! number of lagged non-linearity iterations (inner loop)
128 //! number of warping iterations (number of pyramid levels)
132 //! number of linear system solver iterations
321 * Stopping criterion iterations number used in the numerical scheme.
324 virtual void setNumIterations(int iterations) = 0;
339 int iterations = 300,
|
| /external/opencv3/modules/java/src/ |
| video+Video.java | 131 // C++: void calcOpticalFlowFarneback(Mat prev, Mat next, Mat& flow, double pyr_scale, int levels, int winsize, int iterations, int poly_n, double poly_sigma, int flags)
134 //javadoc: calcOpticalFlowFarneback(prev, next, flow, pyr_scale, levels, winsize, iterations, poly_n, poly_sigma, flags)
135 public static void calcOpticalFlowFarneback(Mat prev, Mat next, Mat flow, double pyr_scale, int levels, int winsize, int iterations, int poly_n, double poly_sigma, int flags)
138 calcOpticalFlowFarneback_0(prev.nativeObj, next.nativeObj, flow.nativeObj, pyr_scale, levels, winsize, iterations, poly_n, poly_sigma, flags);
267 // C++: void calcOpticalFlowFarneback(Mat prev, Mat next, Mat& flow, double pyr_scale, int levels, int winsize, int iterations, int poly_n, double poly_sigma, int flags)
268 private static native void calcOpticalFlowFarneback_0(long prev_nativeObj, long next_nativeObj, long flow_nativeObj, double pyr_scale, int levels, int winsize, int iterations, int poly_n, double poly_sigma, int flags);
|
| /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);
|
| /prebuilts/go/darwin-x86/src/go/doc/testdata/ |
| benchmark.go | 26 // timing and to specify the number of iterations to run.
76 // runN runs a single benchmark for the specified number of iterations.
138 // of benchmark iterations until the benchmark runs for a second in order
157 // Predict iterations/sec.
163 // Run more iterations than we think we'll need for a second (1.5x).
176 N int // The number of iterations.
|
| /prebuilts/go/linux-x86/src/go/doc/testdata/ |
| benchmark.go | 26 // timing and to specify the number of iterations to run.
76 // runN runs a single benchmark for the specified number of iterations.
138 // of benchmark iterations until the benchmark runs for a second in order
157 // Predict iterations/sec.
163 // Run more iterations than we think we'll need for a second (1.5x).
176 N int // The number of iterations.
|
| /external/boringssl/src/crypto/pkcs8/ |
| pkcs8.c | 109 int id, int iterations,
156 for (j = 1; j < iterations; j++) {
223 int salt_len, iterations, ret; local
243 iterations = 1;
245 iterations = ASN1_INTEGER_get(pbe->iter);
250 iterations, EVP_CIPHER_key_length(cipher), key, md)) {
256 iterations, EVP_CIPHER_iv_length(cipher), iv, md)) {
536 int iterations, PKCS8_PRIV_KEY_INFO *p8inf) {
544 salt, salt_len, iterations, p8inf);
556 int iterations, PKCS8_PRIV_KEY_INFO *p8inf)
987 uint64_t iterations; local
[all...] |
| /external/autotest/frontend/tko/ |
| rpc_interface_unittest_fixme.py | 180 # create test attributes, test labels, and iterations
248 self.assertEquals(test['iterations'], [{'attr': {'iattr': 'ival',
515 iterations = rpc_interface.get_test_views(
517 self.assertEquals(len(iterations), 2)
520 self.assertEquals(iterations[index]['test_idx'], 1)
522 self.assertEquals(iterations[0]['iteration_index'], 1)
523 self.assertEquals(iterations[0]['iteration_result_iresult'], 1)
524 self.assertEquals(iterations[0]['iteration_result_iresult2'], 2)
526 self.assertEquals(iterations[1]['iteration_index'], 2)
527 self.assertEquals(iterations[1]['iteration_result_iresult'], 3
[all...] |
| /external/ceres-solver/internal/ceres/ |
| trust_region_minimizer.cc | 247 summary->iterations.push_back(iteration_summary);
265 summary->message = "Maximum number of iterations reached.";
314 iteration_summary.iteration = summary->iterations.back().iteration + 1;
369 summary->iterations.back().gradient_max_norm;
371 summary->iterations.back().gradient_norm;
441 // Disable inner iterations once the relative improvement
447 << "Disabling inner iterations. Progress : "
519 // the trust region radius. However, when inner iterations are
521 // inner iterations and its not fair to credit it all to the
529 // change in solution quality due to inner iterations is so larg
[all...] |
