| /frameworks/base/core/tests/ConnectivityManagerTest/src/com/android/connectivitymanagertest/stress/ |
| WifiStressTest.java | 166 writeOutput(String.format("ssid appear %d out of %d scan iterations",
215 writeOutput(String.format("ssid appear %d out of %d scan iterations",
|
| /frameworks/base/tests/FrameworkPerf/src/com/android/frameworkperf/ |
| FrameworkPerfActivity.java | 68 final String[] mLimitLabels = { "Time", "Iterations" };
223 mLimitLabel.setText("Iterations: ");
|
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/x509/ |
| PolicyQualifierInfoTest.java | 38 // Number of test iterations performed by each thread
|
| /external/ceres-solver/internal/ceres/ |
| iterative_schur_complement_solver.cc | 140 VLOG(2) << "CG Iterations : " << cg_summary.num_iterations;
|
| trust_region_strategy.h | 105 // Number of iterations used by the linear solver. If a linear
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| RealSchur.h | 156 * iterations with implicit double shift. The cost of computing the Schur
157 * decomposition depends on the number of iterations; as a rough guide, it
176 /** \brief Maximum number of iterations.
178 * Maximum number of iterations allowed for an eigenvalue to converge.
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| Scaling.h | 182 int m_maxits; // Maximum number of iterations allowed
|
| /external/guava/guava/src/com/google/common/collect/ |
| StandardRowSortedTable.java | 33 * iterations across the columns keys for a single row key may or may not be
|
| /external/icu4c/test/intltest/ |
| numfmtst.h | 258 void checkRounding(DecimalFormat* df, double base, int iterations, double increment);
|
| /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/constraints/ |
| ConstraintInverseKinematics.java | 83 // int maxIterations = ((Number) data.getFieldValue("iterations")).intValue();
|
| /external/llvm/lib/CodeGen/ |
| PrologEpilogInserter.h | 133 // Initialize DFA sets, called before iterations.
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 105 // simplify all instructions. On later iterations ToSimplify is not
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyInstructions.cpp | 60 // simplify all instructions. On later iterations ToSimplify is not
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2008-08-04-LongAddRec.ll | 2 ; RUN: -scalar-evolution-max-iterations=0 | FileCheck %s
|
| SolveQuadraticEquation.ll | 2 ; RUN: -scalar-evolution-max-iterations=0 | FileCheck %s
|
| trip-count10.ll | 78 ; Trip counts for non-polynomial iterations. It's theoretically possible
|
| /external/netperf/ |
| netcpu_procstat.c | 112 calibrate_idle_rate (int iterations, int interval)
|
| /external/openssl/crypto/bn/ |
| bn_err.c | 133 {ERR_REASON(BN_R_TOO_MANY_ITERATIONS) ,"too many iterations"},
|
| /external/oprofile/module/ |
| op_dname.c | 186 * in N iterations */
|
| /external/qemu/android/utils/ |
| reflist.c | 41 * to stop iterations */
|
| /external/regex-re2/util/ |
| sparse_set.h | 162 // Can sort the sparse array so that future iterations
|
| /external/skia/bench/ |
| PictureRecordBench.cpp | 168 M = SkBENCHLOOP(50000), // number of draw iterations
|
| /external/skia/tests/ |
| GrMemoryPoolTest.cpp | 201 // number of iterations
|
| /external/v8/test/mjsunit/compiler/ |
| math-floor-global.js | 159 // The optimized function will deopt. Run it with enough iterations to try
|
| math-floor-local.js | 159 // The optimized function will deopt. Run it with enough iterations to try
|
